On the public citation graph
Learning Horn definitions: Theory and an application to planning
0 signed · 41 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-63577-7_59openalex-snapshot
Learning acyclic first-order horn sentences from entailment
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_24openalex-snapshot
The Case for Using Equality Axioms in Automatic Demonstration
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf00114802openalex-snapshot
Learning Conjunctive Concepts in Structural Domains
inferredcites →https://doi.org/10.1007/bf00117105openalex-snapshot
Learning Logical Definitions from Relations
inferredcites →https://doi.org/10.1007/bf00992675openalex-snapshot
Learning conjunctions of Horn clauses
inferredcites →https://doi.org/10.1007/bf00992861openalex-snapshot
Interactive concept-learning and constructive induction by analogy
inferredcites →https://doi.org/10.1007/bfb0027308openalex-snapshot
Learning first-order acyclic Horn programs from entailment
inferredcites →https://doi.org/10.1007/bfb0060628openalex-snapshot
The case for using equality axioms in automatic demonstration
inferredcites →https://doi.org/10.1016/0004-3702(72)90051-3openalex-snapshot
Learning and executing generalized robot plans
inferredcites →https://doi.org/10.1016/0004-3702(94)00034-4openalex-snapshot
Pac-learning non-recursive prolog clauses
inferredcites →https://doi.org/10.1016/b978-1-55860-307-3.50022-8openalex-snapshot
Learning From Entailment: An Application to Propositional Horn Sentences
inferredcites →https://doi.org/10.1016/b978-1-55860-335-6.50024-6openalex-snapshot
An Efficient Subsumption Algorithm for Inductive Logic Programming
inferredcites →https://doi.org/10.1016/s0004-3702(97)00041-6openalex-snapshot
Logical settings for concept-learning
inferredcites →https://doi.org/10.1023/a:1022648800760openalex-snapshot
The Strength of Weak Learnability
inferredcites →https://doi.org/10.1023/a:1022664419589openalex-snapshot
Interactive Concept-Learning and Constructive Induction by Analogy
inferredcites →https://doi.org/10.1145/130385.130399openalex-snapshot
PAC-learnability of determinate logic programs
inferredcites →https://doi.org/10.1613/jair.1917openalex-snapshot
Pac-learning Recursive Logic Programs: Negative Results
inferredcites →https://doi.org/10.1613/jair.259openalex-snapshot
Least Generalizations and Greatest Specializations of Sets of Clauses
inferredcites →https://doi.org/10.1613/jair.97openalex-snapshot
Pac-Learning Recursive Logic Programs: Efficient Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2002.3162openalex-snapshot
Learning Closed Horn Expressions
inferred← citeshttps://doi.org/10.1007/3-540-40992-0_18openalex-snapshot
On the Hardness of Learning Acyclic Conjunctive Queries
inferred← citeshttps://doi.org/10.1007/978-0-387-30440-3_308openalex-snapshot
Learning and Planning (Intelligent Systems)
inferred← citeshttps://doi.org/10.1007/978-1-4614-1800-9_110openalex-snapshot
Learning and Planning (Intelligent Systems)
inferred← citeshttps://doi.org/10.1007/978-3-540-39917-9_12openalex-snapshot
On Condensation of a Clause
inferred← citeshttps://doi.org/10.1007/978-3-642-23808-6_11openalex-snapshot
Learning First-Order Definite Theories via Object-Based Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_308-2openalex-snapshot
Learning and Planning (Intelligent Systems)
inferred← citeshttps://doi.org/10.1007/s00778-018-0523-8openalex-snapshot
Logical scalability and efficiency of relational learning algorithms
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.006openalex-snapshot
Prediction-hardness of acyclic conjunctive queries
inferred← citeshttps://doi.org/10.1023/a:1010971904477openalex-snapshot
On Exact Learning of Unordered Tree Patterns
inferred← citeshttps://doi.org/10.1111/j.1467-8640.2008.00330.xopenalex-snapshot
LEARNING TO SOLVE PROBLEMS FROM EXERCISES
inferred← citeshttps://doi.org/10.1145/279943.279980openalex-snapshot
Exact learning of tree patterns from queries and counterexamples
inferred← citeshttps://doi.org/10.1145/3035918.3035923openalex-snapshot
Schema Independent Relational Learning
inferred← citeshttps://doi.org/10.1145/307400.307486openalex-snapshot
Exact learning of unordered tree patterns from queries
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10087openalex-snapshot
A Model for Learning Description Logic Ontologies Based on Exact Learning
inferred← citeshttps://doi.org/10.1609/aimag.v24i2.1705openalex-snapshot
Learning-assisted automated planning: looking back, taking stock, going forward
inferred← citeshttps://doi.org/10.48550/arxiv.1709.07314openalex-snapshot
Exact Learning of Lightweight Description Logic Ontologies
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.