Termination and completion modulo associativity, commutativity and identity
- 5 October 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 104 (1) , 29-51
- https://doi.org/10.1016/0304-3975(92)90165-c
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Completion for rewriting modulo a congruenceTheoretical Computer Science, 1989
- Constrained equational reasoningPublished by Association for Computing Machinery (ACM) ,1989
- Opening the AC-unification raceJournal of Automated Reasoning, 1988
- Termination of rewritingJournal of Symbolic Computation, 1987
- Completion of a Set of Rules Modulo a Set of EquationsSIAM Journal on Computing, 1986
- Termination orderings for associative-commutative rewriting systemsJournal of Symbolic Computation, 1985
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981