On the public citation graph

Learning first-order acyclic Horn programs from entailment

https://doi.org/10.1007/bfb0027308
0 signed · 37 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.
Claim with ORCID
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.
See reference health

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/3540635149_53openalex-snapshot
Learning Horn definitions with equivalence and membership queries
inferredcites →https://doi.org/10.1007/978-3-642-83189-8openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/bf00116828openalex-snapshot
Queries and Concept Learning
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-0-08-094829-4.50008-8openalex-snapshot
ON LEARNING FROM EXERCISES
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/s0004-3702(97)00041-6openalex-snapshot
Logical settings for concept-learning
inferredcites →https://doi.org/10.1023/a:1007571119753openalex-snapshot
Learning to Take Actions
inferredcites →https://doi.org/10.1145/130385.130399openalex-snapshot
PAC-learnability of determinate logic programs
inferredcites →https://doi.org/10.1145/279943.279976openalex-snapshot
Learning first order universal Horn expressions
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/3-540-44673-7_5openalex-snapshot
How to Upgrade Propositional Learners to First Order Logic: A Case Study
inferred← citeshttps://doi.org/10.1007/3-540-44960-4_2openalex-snapshot
A New Algorithm for Learning Range Restricted Horn Expressions
inferred← citeshttps://doi.org/10.1007/3-540-49097-3_10openalex-snapshot
Learning Range Restricted Horn Expressions
inferred← citeshttps://doi.org/10.1007/978-3-540-30109-7_19openalex-snapshot
An Efficient Algorithm for Reducing Clauses Based on Constraint Satisfaction Techniques
inferred← citeshttps://doi.org/10.1007/978-3-540-30215-5_31openalex-snapshot
The Subsumption Lattice and Query Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-30502-6_9openalex-snapshot
Learnability of Simply-Moded Logic Programs from Entailment
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-540-39917-9_4openalex-snapshot
Complexity Parameters for First-Order Classes
inferred← citeshttps://doi.org/10.1007/978-3-540-45167-9_39openalex-snapshot
Polynomial Certificates for Propositional Classes
inferred← citeshttps://doi.org/10.1007/978-3-642-04020-7_58openalex-snapshot
Learning Hereditary and Reductive Prolog Programs from Entailment
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-662-04599-2_10openalex-snapshot
How to Upgrade Propositional Learners to First Order Logic: A Case Study
inferred← citeshttps://doi.org/10.1007/bf03037583openalex-snapshot
Learning Horn definitions: Theory and an application to planning
inferred← citeshttps://doi.org/10.1007/bfb0095294openalex-snapshot
Learning linearly-moded programs from entailment
inferred← citeshttps://doi.org/10.1007/s10994-006-8261-3openalex-snapshot
Complexity parameters for first order classes
inferred← citeshttps://doi.org/10.1016/j.ic.2006.03.001openalex-snapshot
Polynomial certificates for propositional classes
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.06.005openalex-snapshot
The subsumption lattice and query learning
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.006openalex-snapshot
Prediction-hardness of acyclic conjunctive queries
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00270-xopenalex-snapshot
Polynomial-time learnability of logic programs with local variables from entailment
inferred← citeshttps://doi.org/10.1023/a:1007610422992openalex-snapshot
Learning Function-Free Horn Expressions
inferred← citeshttps://doi.org/10.1109/inmic.2008.4777774openalex-snapshot
Investigating models of computational learning theory
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.24963/ijcai.2020/259openalex-snapshot
On the Learnability of Possibilistic Theories
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.