An algebraic approach to unification under associativity and commutativity
Journal of Symbolic Computation
Associative-commutative unification
Journal of Symbolic Computation
Complexity of matching problems
Journal of Symbolic Computation
A note on a canonical theory with undecidable unification and matching problem
Journal of Automated Reasoning
On equational theories, unification, and (Un)decidability
Journal of Symbolic Computation
Unification in permutative equational theories is undecidable
Journal of Symbolic Computation
Handbook of theoretical computer science (vol. B)
String-rewriting systems
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A Unification Algorithm for Associative-Commutative Functions
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report)
Proceedings on Mathematical Foundations of Computer Science
Permutative rewriting and unification
Information and Computation
Unification and Matching Modulo Leaf-Permutative Equational Presentations
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Determining unify-stable presentations
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
E-unification with Constants vs. General E-unification
Journal of Automated Reasoning
Hi-index | 0.00 |
A clear distinction is made between the (elementary) unification problem where there is only one pair of terms to be unified, and the simultaneous unification problem, where many such pairs have to be unified simultaneously – it is shown that there exists a finite, depth-reducing, linear, and confluent term-rewriting system R such that the (single) equational unification problem mod R is decidable, while the simultaneous equational unification problem mod R is undecidable. Also a finite set E of variable-permuting equations is constructed such that equational unification is undecidable mod E, thus settling an open problem. The equational matching problem for variable-permuting theories is shown to be PSPACE-complete.