Completion Without Failure11This research was supported in part by the National Science Foundation under grants DCR 85–13417 and DCR 85–16243.
- 1 January 1989
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Critical pair criteria for completionJournal of Symbolic Computation, 1988
- Existence, Uniqueness, and Construction of Rewrite SystemsSIAM Journal on Computing, 1988
- Termination of rewritingJournal of Symbolic Computation, 1987
- On word problems in equational theoriesPublished by Springer Nature ,1987
- A superposition oriented theorem proverTheoretical Computer Science, 1985
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- A complete proof of correctness of the Knuth-Bendix completion algorithmJournal of Computer and System Sciences, 1981
- A Catalogue of Canonical Term Rewriting Systems.Published by Defense Technical Information Center (DTIC) ,1980
- Proving termination with multiset orderingsCommunications of the ACM, 1979
- Unit Refutations and Horn SetsJournal of the ACM, 1974