On the public citation graph

Polynomial learnability and Inductive Logic Programming: Methods and results

https://doi.org/10.1007/bf03037231
0 signed · 82 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-19129-1_4openalex-snapshot
Unification Revisited
inferredcites →https://doi.org/10.1007/3-540-57868-4_60openalex-snapshot
Sample PAC-learnability in model inference
inferredcites →https://doi.org/10.1007/bf00114802openalex-snapshot
Learning Conjunctive Concepts in Structural Domains
inferredcites →https://doi.org/10.1007/bf00116828openalex-snapshot
Queries and Concept Learning
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/bf03037089openalex-snapshot
Inductive logic programming
inferredcites →https://doi.org/10.1016/0004-3702(88)90001-xopenalex-snapshot
Generalized subsumption and its applications to induction and redundancy
inferredcites →https://doi.org/10.1016/0004-3702(94)00034-4openalex-snapshot
Pac-learning non-recursive prolog clauses
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/0020-0190(94)00074-3openalex-snapshot
Prefix grammars: an alternative characterization of the regular languages
inferredcites →https://doi.org/10.1016/0022-0000(90)90028-jopenalex-snapshot
Prediction-preserving reducibility
inferredcites →https://doi.org/10.1016/b978-0-08-094829-4.50012-xopenalex-snapshot
Equivalence Queries and Approximate Fingerprints
inferredcites →https://doi.org/10.1017/s0022226700002164openalex-snapshot
David Abercrombie, Elements of General Phonetics. Edinburgh: Edinburgh University Press, 1966. Pp. 203.
inferredcites →https://doi.org/10.1023/a:1022648800760openalex-snapshot
The Strength of Weak Learnability
inferredcites →https://doi.org/10.1023/a:1022678217288openalex-snapshot
Flattening and Saturation: Two Representation Changes for Generalization
inferredcites →https://doi.org/10.1073/pnas.89.23.11322openalex-snapshot
Drug design by machine learning: the use of inductive logic programming to model the structure-activity relationships of trimethoprim analogues binding to dihydrofolate reductase.
inferredcites →https://doi.org/10.1080/08839519408945435openalex-snapshot
REPRESENTATION DESIGN AND BRUTE-FORCE INDUCTION IN A BOEING MANUFACTURING DOMAIN
inferredcites →https://doi.org/10.1145/130385.130399openalex-snapshot
PAC-learnability of determinate logic programs
inferredcites →https://doi.org/10.1145/130385.130400openalex-snapshot
Polynomial time inference of a subclass of context-free transformations
inferredcites →https://doi.org/10.1145/130385.130428openalex-snapshot
Some weak learning results
inferredcites →https://doi.org/10.1145/174644.174647openalex-snapshot
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
inferredcites →https://doi.org/10.1145/180139.178095openalex-snapshot
Bayesian inductive logic programming
inferredcites →https://doi.org/10.1145/1968.1972openalex-snapshot
A theory of the learnable
inferredcites →https://doi.org/10.1145/3749740.3749746openalex-snapshot
A Theory of the Learnable
inferredcites →https://doi.org/10.1145/48014.63140openalex-snapshot
Computational limitations on learning from examples
inferredcites →https://doi.org/10.1145/73007.73049openalex-snapshot
Crytographic limitations on learning Boolean formulae and finite automata
inferredcites →https://doi.org/10.1145/76359.76371openalex-snapshot
Learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1613/jair.1917openalex-snapshot
Pac-learning Recursive Logic Programs: Negative Results
inferredcites →https://doi.org/10.5555/93335.93351openalex-snapshot
Equivalence queries and approximate fingerprints

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11536314_21openalex-snapshot
A Study of Applying Dimensionality Reduction to Restrict the Size of a Hypothesis Space
inferred← citeshttps://doi.org/10.1007/11776420_2openalex-snapshot
On Learning and Logic
inferred← citeshttps://doi.org/10.1007/11871842_71openalex-snapshot
(Agnostic) PAC Learning Concepts in Higher-Order Logic
inferred← citeshttps://doi.org/10.1007/3-540-36468-4_8openalex-snapshot
Learnability of Description Logic Programs
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-61286-6_177openalex-snapshot
PAC-learning logic programs under the closed-world assumption
inferred← citeshttps://doi.org/10.1007/3-540-61863-5_46openalex-snapshot
Inductive logic programming beyond logical implication
inferred← citeshttps://doi.org/10.1007/3-540-63494-0_50openalex-snapshot
Feature construction with inductive logic programming: A study of quantitative predictions of biological activity by structural attributes
inferred← citeshttps://doi.org/10.1007/3540635149_31openalex-snapshot
On the complexity of some Inductive Logic Programming problems
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-031-45072-3_15openalex-snapshot
Explaining Optimal Trajectories
inferred← citeshttps://doi.org/10.1007/978-3-319-25255-1_21openalex-snapshot
Knowledge Base Completion Using Matrix Factorization
inferred← citeshttps://doi.org/10.1007/978-3-642-60085-2_14openalex-snapshot
A Perspective on Inductive Logic Programming
inferred← citeshttps://doi.org/10.1007/bf00114009openalex-snapshot
Classic learning
inferred← citeshttps://doi.org/10.1007/bf03037582openalex-snapshot
On the complexity of some inductive logic programming problems
inferred← citeshttps://doi.org/10.1007/s10115-011-0406-4openalex-snapshot
Distribution-free bounds for relational classification
inferred← citeshttps://doi.org/10.1007/s10994-025-06869-zopenalex-snapshot
Common abductive explanations in first order logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.006openalex-snapshot
Prediction-hardness of acyclic conjunctive queries
inferred← citeshttps://doi.org/10.1016/j.websem.2023.100806openalex-snapshot
Comprehensible Artificial Intelligence on Knowledge Graphs: A survey
inferred← citeshttps://doi.org/10.1016/s0004-3702(00)00002-3openalex-snapshot
Robust logics
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00062-5openalex-snapshot
Learning logic programs with structured background knowledge☆☆An extended abstract of this paper appeared in: L. De Raedt (Ed.), Proceedings of the Fifth International Workshop on Inductive Logic Programming, Tokyo, Japan, 1995, pp. 53–76, Scientific Report of the Department of Computer Science,…
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00041-6openalex-snapshot
Logical settings for concept-learning
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:1007406511732openalex-snapshot
Hardness Results for Learning First-Order Representations and Programming by Demonstration
inferred← citeshttps://doi.org/10.1023/a:1009815821645openalex-snapshot
Feature construction with Inductive Logic Programming: A Study of Quantitative Predictions of Biological Activity Aided by Structural Attributes
inferred← citeshttps://doi.org/10.1023/a:1009867806624openalex-snapshot
Scaling Up Inductive Logic Programming by Learning from Interpretations
inferred← citeshttps://doi.org/10.1023/a:1026443024002openalex-snapshot
Classic Learning
inferred← citeshttps://doi.org/10.1109/lics.2017.8005080openalex-snapshot
Learning first-order definable concepts over structures of small degree
inferred← citeshttps://doi.org/10.1109/lics.2019.8785811openalex-snapshot
Learning Concepts Definable in First-Order Logic with Counting
inferred← citeshttps://doi.org/10.1109/tbdata.2018.2867583openalex-snapshot
Link Prediction in Knowledge Graphs: A Hierarchy-Constrained Approach
inferred← citeshttps://doi.org/10.1109/tkde.2008.206openalex-snapshot
Olex: Effective Rule Learning for Text Categorization
inferred← citeshttps://doi.org/10.1145/238061.238066openalex-snapshot
The dual DFA learning problem (extended abstract)
inferred← citeshttps://doi.org/10.1145/301250.301425openalex-snapshot
Robust logics
inferred← citeshttps://doi.org/10.1145/3517804.3524151openalex-snapshot
On the Parameterized Complexity of Learning First-Order Logic
inferred← citeshttps://doi.org/10.1184/r1/28840673openalex-snapshot
Efficient Random Walk Inference with Knowledge Bases
inferred← citeshttps://doi.org/10.1184/r1/6476267openalex-snapshot
Random Walk Inference and Learning in A Large Scale Knowledge Base
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20500openalex-snapshot
On the Complexity of Inductively Learning Guarded Clauses
inferred← citeshttps://doi.org/10.24963/ijcai.2018/255openalex-snapshot
Reverse Engineering Queries in Ontology-Enriched Systems: The Case of Expressive Horn Description Logic Ontologies
inferred← citeshttps://doi.org/10.24963/ijcai.2019/847openalex-snapshot
Synthesizing Datalog Programs using Numerical Relaxation
inferred← citeshttps://doi.org/10.25560/24553openalex-snapshot
Logic Programs as Declarative and Procedural Bias in Inductive Logic Programming
inferred← citeshttps://doi.org/10.25911/5d7a2b326fce6openalex-snapshot
Learning Comprehensible Theories from Structured Data
inferred← citeshttps://doi.org/10.4018/978-1-60960-171-3.ch008openalex-snapshot
Inductive Logic Programming and Embodied Agents
inferred← citeshttps://doi.org/10.4018/jats.2009010103openalex-snapshot
Inductive Logic Programming and Embodied Agents
inferred← citeshttps://doi.org/10.46298/lmcs-21(3:9)2025openalex-snapshot
Learning Concepts Definable in First-Order Logic with Counting
inferred← citeshttps://doi.org/10.48550/arxiv.1702.08367openalex-snapshot
Differentiable Learning of Logical Rules for Knowledge Base Reasoning
inferred← citeshttps://doi.org/10.48550/arxiv.1708.08081openalex-snapshot
Learning MSO-definable hypotheses on string
inferred← citeshttps://doi.org/10.48550/arxiv.1906.00163openalex-snapshot
Synthesizing Datalog Programs Using Numerical Relaxation
inferred← citeshttps://doi.org/10.48550/arxiv.1906.10106openalex-snapshot
Implicitly Learning to Reason in First-Order Logic
inferred← citeshttps://doi.org/10.5555/3329995.3330015openalex-snapshot
Learning first-order definable concepts over structures of small degree
inferred← citeshttps://doi.org/10.70675/4056956dzb9abz47ecz8f08zfe994fc46d42openalex-snapshot
Apprentissage multiannotateur et explications communes en logique du premier ordre
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.