On the public citation graph

An inference method for the complete inverse of relative subsumption

https://doi.org/10.1007/bf03037584
0 signed · 30 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-49730-7_12openalex-snapshot
Logical Aspects of Several Bottom-Up Fittings
inferredcites →https://doi.org/10.1007/3-540-62927-0openalex-snapshot
Foundations of Inductive Logic Programming
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_44openalex-snapshot
On a sufficient condition for the existence of most specific hypothesis in progol
inferredcites →https://doi.org/10.1007/3540635149_58openalex-snapshot
Which hypotheses can be found with inverse 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/978-94-017-0606-3_17openalex-snapshot
Using Abduction for Induction Based on Bottom Generalization
inferredcites →https://doi.org/10.1007/bf03037089openalex-snapshot
Inductive logic programming
inferredcites →https://doi.org/10.1007/bf03037169openalex-snapshot
Classical negation in logic programs and disjunctive databases
inferredcites →https://doi.org/10.1007/bf03037227openalex-snapshot
Inverse entailment and progol
inferredcites →https://doi.org/10.1007/bf03037585openalex-snapshot
Revising the logical foundations of inductive logic programming systems with ground reduced programs
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(88)90001-xopenalex-snapshot
Generalized subsumption and its applications to induction and redundancy
inferredcites →https://doi.org/10.1016/b978-1-55860-200-7.50093-3openalex-snapshot
Completeness for inductive procedures
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

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-36169-3_23openalex-snapshot
Minimised Residue Hypotheses in Relevant Logic
inferred← citeshttps://doi.org/10.1007/3-540-40992-0_12openalex-snapshot
Hypotheses Finding via Residue Hypotheses with the Resolution Principle
inferred← citeshttps://doi.org/10.1007/3-540-44960-4_16openalex-snapshot
New Conditions for the Existence of Least Generalizations under Relative Subsumption
inferred← citeshttps://doi.org/10.1007/3-540-45884-0_16openalex-snapshot
A Theory of Hypothesis Finding in Clausal Logic
inferred← citeshttps://doi.org/10.1007/3-540-49292-5_27openalex-snapshot
Finding Hypotheses from Examples by Computing the Least Generalization of Bottom Clauses
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_12openalex-snapshot
Generalised Kernel Sets for Inverse Entailment
inferred← citeshttps://doi.org/10.1007/978-3-540-39917-9_21openalex-snapshot
Hybrid Abductive Inductive Learning: A Generalisation of Progol
inferred← citeshttps://doi.org/10.1007/bf03037585openalex-snapshot
Revising the logical foundations of inductive logic programming systems with ground reduced programs
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.020openalex-snapshot
Hypothesis finding with proof theoretical appropriateness criteria
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00416-4openalex-snapshot
Hypothesis finding based on upward refinement of residue hypotheses
inferred← citeshttps://doi.org/10.1093/jigpal/12.5.371openalex-snapshot
A Hybrid Abductive Inductive Proof Procedure
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.