On the public citation graph

The undecidability of the unification and matching problem for canonical theories

https://doi.org/10.1007/bf00264362
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-10009-1_25openalex-snapshot
Canonical forms and unification
inferredcites →https://doi.org/10.1007/3-540-15984-3_328openalex-snapshot
Unification in conditional-equational theories
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_1openalex-snapshot
Universal Unification
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1007/978-3-642-96826-6openalex-snapshot
Foundations of Logic Programming
inferredcites →https://doi.org/10.1016/0096-0551(80)90068-5openalex-snapshot
Introduction to formal language theory
inferredcites →https://doi.org/10.1016/0304-3975(75)90011-0openalex-snapshot
A unification algorithm for typed λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(81)90040-2openalex-snapshot
The undecidability of the second-order unification problem
inferredcites →https://doi.org/10.1016/0304-3975(86)90175-1openalex-snapshot
Complete sets of unifiers and matchers in equational theories
inferredcites →https://doi.org/10.1016/0304-3975(88)90008-4openalex-snapshot
A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages
inferredcites →https://doi.org/10.1016/0743-1066(84)90004-9openalex-snapshot
Equality, types, modules, and (why not?) generics for logic programming
inferredcites →https://doi.org/10.1016/s0019-9958(73)90301-xopenalex-snapshot
The undecidability of unification in third order logic
inferredcites →https://doi.org/10.1109/swat.1966.22openalex-snapshot
Simple deterministic languages
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.2307/1968867openalex-snapshot
On Theories with a Combinatorial Definition of "Equivalence"

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.1996.0077openalex-snapshot
Solving a Unification Problem under Constrained Substitutions Using Tree Automata
inferred← citeshttps://doi.org/10.1007/11601548_10openalex-snapshot
Primitive Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_4openalex-snapshot
A unification algorithm for confluent theories
inferred← citeshttps://doi.org/10.1007/3-540-48685-2_2openalex-snapshot
Jeopardy
inferred← citeshttps://doi.org/10.1007/3-540-50667-5_54openalex-snapshot
Functional extensions to prolog: Are they needed?
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-55602-8_194openalex-snapshot
Decidable matching for convergent systems
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_131openalex-snapshot
Solving a unification problem under constrained substitutions using tree automata
inferred← citeshttps://doi.org/10.1007/bf00247435openalex-snapshot
A note on a canonical theory with undecidable unification and matching problem
inferred← citeshttps://doi.org/10.1007/bfb0028998openalex-snapshot
It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03001-5openalex-snapshot
Chapter 1 Knowledge Representation and Classical Logic
inferred← citeshttps://doi.org/10.1023/a:1005764526878openalex-snapshot
Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories
inferred← citeshttps://doi.org/10.1109/jcit.1990.128313openalex-snapshot
A parallel implementation of equational programming
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.