On the public citation graph
On the complexity of some inductive logic programming problems
0 signed · 57 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-63255-7_27openalex-snapshot
A deductive system for non-monotonic reasoning
inferredcites →https://doi.org/10.1007/bf01536399openalex-snapshot
On the computational cost of disjunctive logic programming: Propositional case
inferredcites →https://doi.org/10.1007/bf03037231openalex-snapshot
Polynomial learnability and Inductive Logic Programming: Methods and results
inferredcites →https://doi.org/10.1016/0004-3702(80)90014-4openalex-snapshot
A logic for default reasoning
inferredcites →https://doi.org/10.1016/0004-3702(88)90002-1openalex-snapshot
Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
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(87)90103-7openalex-snapshot
Subsumption and implication
inferredcites →https://doi.org/10.1016/0022-0000(92)90019-fopenalex-snapshot
On the theory of average case complexity
inferredcites →https://doi.org/10.1016/0196-6774(84)90032-4openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0743-1066(94)90035-3openalex-snapshot
Inductive Logic Programming: Theory and methods
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50007-2openalex-snapshot
A Catalog of Complexity Classes
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/s0019-9958(67)91165-5openalex-snapshot
Language identification in the limit
inferredcites →https://doi.org/10.1023/a:1022648800760openalex-snapshot
The Strength of Weak Learnability
inferredcites →https://doi.org/10.1093/logcom/2.3.397openalex-snapshot
Complexity Results for Nonmonotonic Logics
inferredcites →https://doi.org/10.1126/science.7973651openalex-snapshot
Molecular Computation of Solutions to Combinatorial Problems
inferredcites →https://doi.org/10.1145/181668.181674openalex-snapshot
Inductive logic programming and learnability
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
inferredcites →https://doi.org/10.1613/jair.1917openalex-snapshot
Pac-learning Recursive Logic Programs: Negative Results
inferredcites →https://doi.org/10.1613/jair.97openalex-snapshot
Pac-Learning Recursive Logic Programs: Efficient Algorithms
inferredcites →https://doi.org/10.5555/1622826.1622843openalex-snapshot
Pac-learning recursive logic programs
inferredcites →https://doi.org/10.7551/mitpress/4307.003.0007openalex-snapshot
Implementing Semantics of Disjunctive Logic Programs Using Fringes and Abstract Properties
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4419-1428-6_1794openalex-snapshot
Constraint Satisfaction for Learning Hypotheses in Inductive Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-85928-4_6openalex-snapshot
A Model to Study Phase Transition and Plateaus in Relational Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-04180-8_21openalex-snapshot
Empirical Study of Relational Learning Algorithms in the Phase Transition Framework
inferred← citeshttps://doi.org/10.1007/978-3-642-11266-9_11openalex-snapshot
Taming the Complexity of Inductive Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-15431-7_11openalex-snapshot
Constraint Models for Reasoning on Unification in Inductive Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-25324-9_14openalex-snapshot
On Generating Templates for Hypothesis in Inductive Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-33185-5_21openalex-snapshot
Decomposition, Merging, and Refinement Approach to Boost Inductive Logic Programming Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-38812-5_15openalex-snapshot
What Kinds of Relational Features Are Useful for Statistical Learning?
inferred← citeshttps://doi.org/10.1007/s10601-013-9141-7openalex-snapshot
Formulating the template ILP consistency problem as a constraint satisfaction problem
inferred← citeshttps://doi.org/10.1007/s10994-007-5031-9openalex-snapshot
On the connection between the phase transition of the covering test and the learning success rate in ILP
inferred← citeshttps://doi.org/10.1007/s10994-019-05834-xopenalex-snapshot
Logical reduction of metarules
inferred← citeshttps://doi.org/10.1109/icde65706.2026.00089openalex-snapshot
Reconstructing TensorLog for Scalable End-to-End Rule Learning
inferred← citeshttps://doi.org/10.1109/ictai.2011.153openalex-snapshot
Boosting Inductive Logic Programming via Decomposition, Merging, and Refinement
inferred← citeshttps://doi.org/10.1109/tkde.2008.206openalex-snapshot
Olex: Effective Rule Learning for Text Categorization
inferred← citeshttps://doi.org/10.1145/1376916.1376921openalex-snapshot
On the complexity of deriving schema mappings from database instances
inferred← citeshttps://doi.org/10.1145/1667053.1667055openalex-snapshot
Schema mapping discovery from data instances
inferred← citeshttps://doi.org/10.1145/3584372.3588655openalex-snapshot
Extremal Fitting Problems for Conjunctive Queries
inferred← citeshttps://doi.org/10.1145/3641832.3641834openalex-snapshot
Fitting Algorithms for Conjunctive Queries
inferred← citeshttps://doi.org/10.1145/3858670openalex-snapshot
Extremal Fitting Problems for Conjunctive Queries
inferred← citeshttps://doi.org/10.1145/502807.502810openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20500openalex-snapshot
On the Complexity of Inductively Learning Guarded Clauses
inferred← citeshttps://doi.org/10.1613/jair.1.13507openalex-snapshot
Inductive Logic Programming At 30: A New Introduction
inferred← citeshttps://doi.org/10.24963/ijcai.2023/373openalex-snapshot
SAT-Based PAC Learning of Description Logic Concepts
inferred← citeshttps://doi.org/10.48550/arxiv.1809.10054openalex-snapshot
General-purpose Declarative Inductive Programming with Domain-Specific Background Knowledge for Data Wrangling Automation
inferred← citeshttps://doi.org/10.48550/arxiv.2110.03624openalex-snapshot
On the Complexity of Inductively Learning Guarded Rules
inferred← citeshttps://doi.org/10.4995/thesis/10251/160724openalex-snapshot
Towards Data Wrangling Automation through Dynamically-Selected Background Knowledge
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.