On the public citation graph
A framework for defining distances between first-order logic objects
0 signed · 59 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-62858-4_78openalex-snapshot
Metrics on terms and clauses
inferredcites →https://doi.org/10.1007/3-540-63494-0_47openalex-snapshot
Applying ILP to diterpene structure elucidation from 13C NMR spectra
inferredcites →https://doi.org/10.1007/3540635149_50openalex-snapshot
Distance between Herbrand interpretations: A measure for approximations to a target concept
inferredcites →https://doi.org/10.1007/bfb0027331openalex-snapshot
A framework for defining distances between first-order logic objects
inferredcites →https://doi.org/10.1007/s002360050075openalex-snapshot
Distance measures for point sets and their computation
inferredcites →https://doi.org/10.1016/0004-3702(94)90112-0openalex-snapshot
First-order jk-clausal theories are PAC-learnable
inferredcites →https://doi.org/10.1016/s0004-3702(97)00041-6openalex-snapshot
Logical settings for concept-learning
inferredcites →https://doi.org/10.1016/s0004-3702(98)00034-4openalex-snapshot
Top-down induction of first-order logical decision trees
inferredcites →https://doi.org/10.1080/088395198117686openalex-snapshot
Diterpene structure elucidation from 13cnmr spectra with inductive logic programming
inferredcites →https://doi.org/10.48550/arxiv.cs/0011032openalex-snapshot
Top-down induction of clustering trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11563983_15openalex-snapshot
Support Vector Inductive Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-33486-6_5openalex-snapshot
Support Vector Inductive Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-36131-6_20openalex-snapshot
A Quasi-Metric for Machine Learning
inferred← citeshttps://doi.org/10.1007/3-540-44797-0_2openalex-snapshot
Learning Logic Programs with Neural Networks
inferred← citeshttps://doi.org/10.1007/3-540-44960-4_7openalex-snapshot
Extending K-Means Clustering to First-Order Representations
inferred← citeshttps://doi.org/10.1007/3-540-45164-1_27openalex-snapshot
Metric-Based Inductive Learning Using Semantic Height Functions
inferred← citeshttps://doi.org/10.1007/3-540-45331-8_32openalex-snapshot
Coverage-Based Semi-distance between Horn Clauses
inferred← citeshttps://doi.org/10.1007/3-540-48751-4_25openalex-snapshot
Instance based function learning
inferred← citeshttps://doi.org/10.1007/978-0-387-30164-8_396openalex-snapshot
Inductive Logic Programming
inferred← citeshttps://doi.org/10.1007/978-1-4899-7502-7_135-1openalex-snapshot
Inductive Logic Programming
inferred← citeshttps://doi.org/10.1007/978-1-4899-7687-1_135openalex-snapshot
Inductive Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-45260-5_4openalex-snapshot
Computing Abstract Distances in Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-28631-8_31openalex-snapshot
Case-Based Relational Learning of Expressive Phrasing in Classical Music
inferred← citeshttps://doi.org/10.1007/978-3-540-39917-9_17openalex-snapshot
Improved Distances for Structured Data
inferred← citeshttps://doi.org/10.1007/978-3-540-39917-9_24openalex-snapshot
Relational IBL in Music with a New Structural Similarity Measure
inferred← citeshttps://doi.org/10.1007/978-3-540-45210-2_12openalex-snapshot
Generalizing Programs via Subsumption
inferred← citeshttps://doi.org/10.1007/978-3-540-68123-6_15openalex-snapshot
A Multi-relational Hierarchical Clustering Method for Datalog Knowledge Bases
inferred← citeshttps://doi.org/10.1007/978-3-540-73847-3_21openalex-snapshot
Minimal Distance-Based Generalisation Operators for First-Order Objects
inferred← citeshttps://doi.org/10.1007/978-3-540-78469-2_1openalex-snapshot
Learning with Kernels and Logical Representations
inferred← citeshttps://doi.org/10.1007/978-3-540-78469-2_7openalex-snapshot
Induction of Optimal Semantic Semi-distances for Clausal Knowledge Bases
inferred← citeshttps://doi.org/10.1007/978-3-540-78652-8_3openalex-snapshot
Learning with Kernels and Logical Representations
inferred← citeshttps://doi.org/10.1007/978-3-642-12251-4_12openalex-snapshot
An Integrated Distance for Atoms
inferred← citeshttps://doi.org/10.1007/978-3-642-18690-5_9openalex-snapshot
Logical Languages for Data Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-21295-6_6openalex-snapshot
Not Far Away from Home: A Relational Distance-Based Approach to Understanding Images of Houses
inferred← citeshttps://doi.org/10.1007/978-3-642-21916-0_28openalex-snapshot
Learning with Semantic Kernels for Clausal Knowledge Bases
inferred← citeshttps://doi.org/10.1007/978-3-642-31951-8_16openalex-snapshot
Conceptual Clustering of Multi-Relational Data
inferred← citeshttps://doi.org/10.1007/978-3-662-04599-2_9openalex-snapshot
Distance Based Approaches to Relational Learning and Clustering
inferred← citeshttps://doi.org/10.1007/pl00013304openalex-snapshot
A polynomial time computable metric between point sets
inferred← citeshttps://doi.org/10.1007/s10462-020-09821-wopenalex-snapshot
An overview of distance and similarity functions for structured data
inferred← citeshttps://doi.org/10.1007/s10489-021-02469-1openalex-snapshot
Axiom selection over large theory based on new first-order formula metrics
inferred← citeshttps://doi.org/10.1007/s10994-006-8260-4openalex-snapshot
Relational IBL in classical music
inferred← citeshttps://doi.org/10.1007/s10994-009-5163-1openalex-snapshot
Fast learning of relational kernels
inferred← citeshttps://doi.org/10.1007/s10994-019-05794-2openalex-snapshot
Semi-supervised online structure learning for composite event recognition
inferred← citeshttps://doi.org/10.1007/s10994-023-06447-1openalex-snapshot
Online semi-supervised learning of composite event rules by combining structure and mass-based predicate similarity
inferred← citeshttps://doi.org/10.1023/a:1007668716498openalex-snapshot
Relational Instance-Based Learning with Lists and Terms
inferred← citeshttps://doi.org/10.1093/bioinformatics/btr337openalex-snapshot
Annotation concept synthesis and enrichment analysis: a logic-based approach to the interpretation of high-throughput experiments
inferred← citeshttps://doi.org/10.1109/iske.2017.8258778openalex-snapshot
New terms metric based on substitutions
inferred← citeshttps://doi.org/10.1109/wi.2005.115openalex-snapshot
Personalized Web Recommendations: Supporting Epistemic Information about End-Users
inferred← citeshttps://doi.org/10.1111/coin.12004openalex-snapshot
BRIDGING THE GAP BETWEEN DISTANCE AND GENERALIZATION
inferred← citeshttps://doi.org/10.1142/s0218213001000519openalex-snapshot
AN ALGEBRAIC APPROACH TO INDUCTIVE LEARNING
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-249openalex-snapshot
Concept Dissimilarity Based on Tree Edit Distances and Morphological Dilations
inferred← citeshttps://doi.org/10.4230/dagsemproc.05051.8openalex-snapshot
Kernels on Prolog Proof Trees:Statistical Learning in the ILP Setting
inferred← citeshttps://doi.org/10.48550/arxiv.1109.5078openalex-snapshot
Application of distances between terms for flat and hierarchical data
inferred← citeshttps://doi.org/10.48550/arxiv.1910.00293openalex-snapshot
Distance-Based Approaches to Repair Semantics in Ontology-based Data Access
inferred← citeshttps://doi.org/10.70675/2a92e89az5c38z4601z9d30zc1df174d15caopenalex-snapshot
Etude mathématique de modèles quantiques et classiques pour les matériaux aléatoires à l'échelle atomique
showing the first 46 of 47 · page through all 47
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.