On the public citation graph

Universal unification and a classification of equational theories

https://doi.org/10.1007/bfb0000071
0 signed · 51 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/978-0-387-34768-4_1openalex-snapshot
Universal Unification
inferredcites →https://doi.org/10.1007/978-0-387-77487-9openalex-snapshot
Universal Algebra
inferredcites →https://doi.org/10.1007/978-3-642-68826-3_13openalex-snapshot
Universal Unification and a Class of Equational Theories
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_33openalex-snapshot
Maximal Models and Refutation Completeness: Semidecision Procedures in Automatic Theorem Proving
inferredcites →https://doi.org/10.1007/bf02573590openalex-snapshot
A Noetherian and confluent rewrite system for idempotent semigroups
inferredcites →https://doi.org/10.1007/bfb0029526openalex-snapshot
Unification in typed lambda calculus
inferredcites →https://doi.org/10.1016/0022-0000(78)90043-0openalex-snapshot
Linear unification
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/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
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.1016/s0019-9958(78)90172-9openalex-snapshot
The undecidability of the third order dyadic unification problem
inferredcites →https://doi.org/10.1016/s0049-237x(08)71923-2openalex-snapshot
Maximal Models and Refutation Completeness: Semidecision Procedures in Automatic Theorem Proving
inferredcites →https://doi.org/10.1070/sm1977v032n02abeh002376openalex-snapshot
THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
inferredcites →https://doi.org/10.1080/00029890.1973.11993265openalex-snapshot
Hilbert's Tenth Problem is Unsolvable
inferredcites →https://doi.org/10.1111/j.1755-2567.1960.tb00558.xopenalex-snapshot
An improved proof procedure1
inferredcites →https://doi.org/10.1145/1089208.1089210openalex-snapshot
A short survey on the state of the art in matching and unification problems
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/321420.321429openalex-snapshot
The Concept of Demodulation in Theorem Proving
inferredcites →https://doi.org/10.1145/321495.321500openalex-snapshot
Semi-Automated Mathematics
inferredcites →https://doi.org/10.1145/321850.321859openalex-snapshot
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
inferredcites →https://doi.org/10.1145/321906.321919openalex-snapshot
A Proof Procedure Using Connection Graphs
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/322248.322251openalex-snapshot
Complete Sets of Reductions for Some Equational Theories
inferredcites →https://doi.org/10.1145/357162.357169openalex-snapshot
An Efficient Unification Algorithm
inferredcites →https://doi.org/10.21236/ad0646560openalex-snapshot
A MATCHING PROCEDURE FOR W-ORDER LOGIC
inferredcites →https://doi.org/10.21236/ada015846openalex-snapshot
A Complete Unification Algorithm for Associative-Commutative Functions
inferredcites →https://doi.org/10.21236/ada087640openalex-snapshot
Canonical Forms and Unification.
inferredcites →https://doi.org/10.21236/ada087641openalex-snapshot
A Catalogue of Canonical Term Rewriting Systems.

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-15976-2_1openalex-snapshot
Basic features and development of the critical-pair/completion procedure
inferred← citeshttps://doi.org/10.1007/3-540-45406-3_2openalex-snapshot
Constraint Solving on Terms
inferred← citeshttps://doi.org/10.1007/3-540-58156-1_41openalex-snapshot
The complexity of counting problems in equational matching
inferred← citeshttps://doi.org/10.1007/978-0-387-34768-4_1openalex-snapshot
Universal Unification
inferred← citeshttps://doi.org/10.1007/978-0-387-34768-4_14openalex-snapshot
A New Equational Unification Method: A Generalisation of Martelli-Montanari’s Algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_7openalex-snapshot
Designing Unification Procedures Using Transformations: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-68826-3_13openalex-snapshot
Universal Unification and a Class of Equational Theories
inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_2openalex-snapshot
Theoretical Issues of Logic Programming
inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_3openalex-snapshot
Unification — Theory and Practice
inferred← citeshttps://doi.org/10.1007/bf01069967openalex-snapshot
Automatic theorem proving. I
inferred← citeshttps://doi.org/10.1007/bf02733227openalex-snapshot
Unification problem in equational theories
inferred← citeshttps://doi.org/10.1007/bf03037103openalex-snapshot
Knowledge information processing language: ShapeUp
inferred← citeshttps://doi.org/10.1016/0004-3702(88)90001-xopenalex-snapshot
Generalized subsumption and its applications to induction and redundancy
inferred← citeshttps://doi.org/10.1016/0743-1066(84)90010-4openalex-snapshot
A theory of complete logic programs with equality
inferred← citeshttps://doi.org/10.1016/0743-1066(87)90006-9openalex-snapshot
Logic programming with equations
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90024-wopenalex-snapshot
Logic programming with functions and predicates: The language Babel
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90034-5openalex-snapshot
The integration of functions into logic programming: From theory to practice
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80020-2openalex-snapshot
History and basic features of the critical-pair/completion procedure
inferred← citeshttps://doi.org/10.1109/lics.1990.113753openalex-snapshot
Syntactic theories and unification
inferred← citeshttps://doi.org/10.1145/5383.5389openalex-snapshot
Equality-based binary resolution
inferred← citeshttps://doi.org/10.1145/78935.78938openalex-snapshot
Minimal and complete word unification
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.