On the public citation graph

A note on a canonical theory with undecidable unification and matching problem

https://doi.org/10.1007/bf00247435
0 signed · 21 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-15976-2_7openalex-snapshot
NARROWER: a new algorithm for unification and its application to Logic Programming
inferredcites →https://doi.org/10.1007/bf00264362openalex-snapshot
The undecidability of the unification and matching problem for canonical theories
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferredcites →https://doi.org/10.1080/00029890.1973.11993265openalex-snapshot
Hilbert's Tenth Problem is Unsolvable

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jsco.1997.0188openalex-snapshot
A Semantic Approach to Order-sorted Rewriting
inferred← citeshttps://doi.org/10.1007/11601548_10openalex-snapshot
Primitive Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_2openalex-snapshot
Constraint Solving on Terms
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_60openalex-snapshot
Narrowing with built-in theories
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_83openalex-snapshot
Rewriting, and equational unification: the higher-order cases
inferred← citeshttps://doi.org/10.1007/3-540-55124-7_6openalex-snapshot
Algebraic and logical aspects of unification
inferred← citeshttps://doi.org/10.1007/3-540-55124-7_7openalex-snapshot
Model-theoretic aspects of unification
inferred← citeshttps://doi.org/10.1007/3-540-55602-8_194openalex-snapshot
Decidable matching for convergent systems
inferred← citeshttps://doi.org/10.1007/3-540-56868-9_5openalex-snapshot
A semantic approach to order-sorted rewriting
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_175openalex-snapshot
A semantic matching algorithm: Analysis and implementation
inferred← citeshttps://doi.org/10.1007/3540539816_68openalex-snapshot
Exploiting non-determinism through laziness in guarded functional languages
inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_4openalex-snapshot
Computation Paradigms in Light of Hilbert's Tenth Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-21551-7_5openalex-snapshot
A semantic approach to order-sorted rewriting
inferred← citeshttps://doi.org/10.1007/bfb0020795openalex-snapshot
Decision problems for term rewriting systems and recognizable tree languages
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50014-xopenalex-snapshot
Solving Numerical Constraints
inferred← citeshttps://doi.org/10.1023/a:1005764526878openalex-snapshot
Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories
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.