On the public citation graph

On inductive inference of cyclic structures

https://doi.org/10.1007/bf01534454
0 signed · 29 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-54345-7_44openalex-snapshot
Elimination of negation in term algebras
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_11openalex-snapshot
Negation as Failure
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1007/978-94-009-7893-5_13openalex-snapshot
Fundamental Properties of Infinite Trees
inferredcites →https://doi.org/10.1007/bf00243794openalex-snapshot
Explicit representation of terms defined by counter examples
inferredcites →https://doi.org/10.1016/0004-3702(82)90040-6openalex-snapshot
Generalization as search
inferredcites →https://doi.org/10.1016/0004-3702(91)90040-qopenalex-snapshot
The description identification problem
inferredcites →https://doi.org/10.1016/0304-3975(83)90059-2openalex-snapshot
Fundamental properties of infinite trees
inferredcites →https://doi.org/10.1016/0304-3975(86)90027-7openalex-snapshot
Semantics of infinite tree logic programming
inferredcites →https://doi.org/10.1016/0304-3975(86)90050-2openalex-snapshot
Equivalences and transformations of regular systems—Applications to recursive program schemes and grammars
inferredcites →https://doi.org/10.1016/0743-1066(87)90007-0openalex-snapshot
Negation in logic programming
inferredcites →https://doi.org/10.1016/s0747-7171(85)80027-4openalex-snapshot
Properties of substitutions and unifications
inferredcites →https://doi.org/10.1016/s0747-7171(89)80017-3openalex-snapshot
Equational problems anddisunification
inferredcites →https://doi.org/10.1109/lics.1988.5109openalex-snapshot
Efficient parallel algorithms for anti-unification and relative complement
inferredcites →https://doi.org/10.1109/lics.1988.5132openalex-snapshot
Complete axiomatizations of the algebras of finite, rational and infinite trees
inferredcites →https://doi.org/10.1109/lics.1991.151657openalex-snapshot
Constructive negation for constraint logic programming
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
inferredcites →https://doi.org/10.1145/41625.41635openalex-snapshot
Constraint logic programming

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.1994.1001openalex-snapshot
Decidability of the Existential Theory of Infinite Terms with Subterm Relation
inferred← citeshttps://doi.org/10.1007/10721975_13openalex-snapshot
The Explicit Representability of Implicit Generalizations
inferred← citeshttps://doi.org/10.1007/11532231_30openalex-snapshot
Model Representation via Contexts and Implicit Generalizations
inferred← citeshttps://doi.org/10.1007/11799573_32openalex-snapshot
Solving First-Order Constraints in the Theory of the Evaluated Trees
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_52openalex-snapshot
Negation Elimination from Simple Equational Formulae
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_2openalex-snapshot
Constraint Solving on Terms
inferred← citeshttps://doi.org/10.1007/978-3-540-73817-6_7openalex-snapshot
Solving First-Order Constraints in the Theory of the Evaluated Trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00583-2openalex-snapshot
Explicit versus implicit representations of subsets of the Herbrand universe
inferred← citeshttps://doi.org/10.1017/s1471068407003171openalex-snapshot
Theory of finite or infinite trees revisited
inferred← citeshttps://doi.org/10.1093/logcom/exm008openalex-snapshot
Model Representation over Finite and Infinite Signatures
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.