Unification in permutative equational theories is undecidable
Open Access
- 31 October 1989
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 8 (4) , 415-421
- https://doi.org/10.1016/s0747-7171(89)80037-9
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Unification theoryJournal of Symbolic Computation, 1989
- Unification in Abelian semigroupsJournal of Automated Reasoning, 1987
- An algebraic approach to unification under associativity and commutativityJournal of Symbolic Computation, 1987
- Unification in datastructure multisetsJournal of Automated Reasoning, 1986
- A Unification Algorithm for Associative-Commutative FunctionsJournal of the ACM, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965