Complexity of unification problems with associative-commutative operators
- 1 October 1992
- journal article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 9 (2) , 261-288
- https://doi.org/10.1007/bf00245463
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Opening the AC-unification raceJournal of Automated Reasoning, 1988
- Unification in varieties of idempotent semigroupsSemigroup Forum, 1987
- Associative-commutative unificationJournal of Symbolic Computation, 1987
- An algebraic approach to unification under associativity and commutativityJournal of Symbolic Computation, 1987
- Complexity of matching problemsJournal of Symbolic Computation, 1987
- NP-completeness of the set unification and matching problemsPublished by Springer Nature ,1986
- The Complexity of Distributed Concurrency ControlSIAM Journal on Computing, 1985
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984
- A Unification Algorithm for Associative-Commutative FunctionsJournal of the ACM, 1981
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981