On the public citation graph

Complexity-based induction

https://doi.org/10.1007/bf00993307
0 signed · 49 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.1002/0471667196.ess1641openalex-snapshot
Minimum‐Description‐Length Principle
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/bf00116251openalex-snapshot
Induction of Decision Trees
inferredcites →https://doi.org/10.1007/bf00117105openalex-snapshot
Learning Logical Definitions from Relations
inferredcites →https://doi.org/10.1007/bf03037089openalex-snapshot
Inductive logic programming
inferredcites →https://doi.org/10.1016/0004-3702(82)90040-6openalex-snapshot
Generalization as search
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(90)90059-9openalex-snapshot
Quantitative results concerning the utility of explanation-based learning
inferredcites →https://doi.org/10.1016/0022-0000(92)90026-fopenalex-snapshot
Inductive reasoning and kolmogorov complexity
inferredcites →https://doi.org/10.1016/b978-0-934613-03-3.50040-4openalex-snapshot
Generalization as Search
inferredcites →https://doi.org/10.1016/b978-1-55860-247-2.50048-6openalex-snapshot
Compression, Significance and Accuracy
inferredcites →https://doi.org/10.1016/s0019-9958(67)91165-5openalex-snapshot
Language identification in the limit
inferredcites →https://doi.org/10.1016/s0019-9958(72)90424-xopenalex-snapshot
Some decidability results on grammatical inference and complexity
inferredcites →https://doi.org/10.1016/s0019-9958(80)90285-5openalex-snapshot
Inductive inference of formal languages from positive data
inferredcites →https://doi.org/10.1016/s0020-7373(76)80005-3openalex-snapshot
Behaviour/structure transformations under uncertainty
inferredcites →https://doi.org/10.1023/a:1022678217288openalex-snapshot
Flattening and Saturation: Two Representation Changes for Generalization
inferredcites →https://doi.org/10.1063/1.3060577openalex-snapshot
The Logic of Scientific Discovery
inferredcites →https://doi.org/10.1109/mex.1987.4307074openalex-snapshot
The Art of Prolog
inferredcites →https://doi.org/10.1109/tit.1978.1055913openalex-snapshot
Complexity-based induction systems: Comparisons and convergence theorems
inferredcites →https://doi.org/10.1142/0531openalex-snapshot
Information, Randomness & Incompleteness
inferredcites →https://doi.org/10.1145/130836.1063179openalex-snapshot
Book review: Computational Models of Scientific Discovery and Theory Formation Edited by Jeff Shrager & Pat Langley (Morgan Kaufmann San Mateo, CA, 1990)
inferredcites →https://doi.org/10.1145/180139.178095openalex-snapshot
Bayesian inductive logic programming
inferredcites →https://doi.org/10.1145/214762.214771openalex-snapshot
Arithmetic coding for data compression
inferredcites →https://doi.org/10.1145/356827.356829openalex-snapshot
Probabilistic Languages: A Review and Some Open Questions
inferredcites →https://doi.org/10.2307/1907578openalex-snapshot
The Logic of Scientific Discovery
inferredcites →https://doi.org/10.4324/9780203090732-9openalex-snapshot
The Logic of Scientific Discovery
inferredcites →https://doi.org/10.7551/mitpress/1192.001.0001openalex-snapshot
Algorithmic Program Debugging

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-46769-6_1openalex-snapshot
Tailoring Representations to Different Requirements
inferred← citeshttps://doi.org/10.1007/3-540-56602-3_125openalex-snapshot
Inductive logic programming: Derivations, successes and shortcomings
inferred← citeshttps://doi.org/10.1007/3-540-63494-0_66openalex-snapshot
λ-Subsumption and its application to learning from positive-only examples
inferred← citeshttps://doi.org/10.1007/978-3-319-25007-6_31openalex-snapshot
General Terminology Induction in OWL
inferred← citeshttps://doi.org/10.1007/978-3-540-68880-8_19openalex-snapshot
Facility Location Problems: A Parameterized View
inferred← citeshttps://doi.org/10.1007/bf03037227openalex-snapshot
Inverse entailment and progol
inferred← citeshttps://doi.org/10.1007/bfb0027325openalex-snapshot
Generalization under implication by λ-subsumption
inferred← citeshttps://doi.org/10.1007/bfb0057457openalex-snapshot
A framework for inductive learning based on subsumption lattices
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90035-3openalex-snapshot
Inductive Logic Programming: Theory and methods
inferred← citeshttps://doi.org/10.1016/j.cognition.2009.09.003openalex-snapshot
A probabilistic model of theory formation
inferred← citeshttps://doi.org/10.1016/j.dam.2011.03.021openalex-snapshot
Facility location problems: A parameterized view
inferred← citeshttps://doi.org/10.1023/a:1011350914776openalex-snapshot
Explanatory and Creative Alternatives to the MDL priciple
inferred← citeshttps://doi.org/10.1037/a0029347openalex-snapshot
Exploring the conceptual universe.
inferred← citeshttps://doi.org/10.1037/a0039980openalex-snapshot
The logical primitives of thought: Empirical foundations for compositional cognitive models.
inferred← citeshttps://doi.org/10.1080/09528130701538190openalex-snapshot
Agent's actions as a classification criteria for the state space in a learning from rewards system
inferred← citeshttps://doi.org/10.1109/anziis.1994.396995openalex-snapshot
Objective evaluation of inferred context-free grammars
inferred← citeshttps://doi.org/10.1145/181668.181671openalex-snapshot
Inductive logic programming
inferred← citeshttps://doi.org/10.1184/r1/6613295openalex-snapshot
Abstraction and relational learning
inferred← citeshttps://doi.org/10.1184/r1/6616931openalex-snapshot
Learning and using relational theories
inferred← citeshttps://doi.org/10.1609/aaai.v38i9.28925openalex-snapshot
Learning MDL Logic Programs from Noisy Data
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0212039openalex-snapshot
Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classification
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.