An overview of Rewrite Rule Laboratory (RRL)
- 1 January 1995
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 29 (2) , 91-114
- https://doi.org/10.1016/0898-1221(94)00218-a
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Complexity of unification problems with associative-commutative operatorsJournal of Automated Reasoning, 1992
- Sufficient-completeness, ground-reducibility and their complexityActa Informatica, 1991
- Unnecessary inferences in associative-commutative completion proceduresTheory of Computing Systems, 1990
- Automated proofs of the moufang identities in alternative ringsJournal of Automated Reasoning, 1990
- Proving equivalence of different axiomatizations of free groupsJournal of Automated Reasoning, 1988
- Matching, unification and complexityACM SIGSAM Bulletin, 1987
- Proof by consistencyArtificial Intelligence, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- Complexity of matching problemsJournal of Symbolic Computation, 1987
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981