On the public citation graph

Maximal unifiable subsets and minimal nonunifiable subsets

https://doi.org/10.1007/bf03037439
0 signed · 17 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/bfb0000062openalex-snapshot
Exponential improvement of efficient backtracking
inferredcites →https://doi.org/10.1007/bfb0000063openalex-snapshot
Exponential improvement of exhaustive backtracking: data structure and implementation
inferredcites →https://doi.org/10.1016/0304-3975(84)90017-3openalex-snapshot
Closures and fairness in the semantics of programming logic
inferredcites →https://doi.org/10.1145/1005937.1005947openalex-snapshot
Logic for problem solving

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-16492-8_68openalex-snapshot
Intractable unifiability problems and backtracking
inferred← citeshttps://doi.org/10.1007/3-540-61479-6_16openalex-snapshot
A brief overview of over-constrained systems
inferred← citeshttps://doi.org/10.1007/978-3-540-45085-6_39openalex-snapshot
Source-Tracking Unification
inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_3openalex-snapshot
Unification — Theory and Practice
inferred← citeshttps://doi.org/10.1007/bf00245020openalex-snapshot
Intractable unifiability problems and backtracking
inferred← citeshttps://doi.org/10.1007/bf03037466openalex-snapshot
On parallel unification for Prolog
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90121-xopenalex-snapshot
An improved data-dependency-based backtracking scheme for prolog
inferred← citeshttps://doi.org/10.1016/0743-1066(87)90021-5openalex-snapshot
On determining the causes of nonunifiability
inferred← citeshttps://doi.org/10.1016/j.ic.2004.10.013openalex-snapshot
Source-tracking unification
inferred← citeshttps://doi.org/10.1109/69.494164openalex-snapshot
A high-level Petri net for goal-directed semantics of Horn clause logic
inferred← citeshttps://doi.org/10.1109/tai.1989.65320openalex-snapshot
A new intelligent backtracking scheme for Prolog: a summary of results
inferred← citeshttps://doi.org/10.1109/tai.1989.65357openalex-snapshot
A history-based scheme for accelerating Prolog interpretation
inferred← citeshttps://doi.org/10.1145/62029.62030openalex-snapshot
Unification: a multidisciplinary survey
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.