Efficient ground completion
- 1 January 1989
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Rigid E-Unification and, Its Applications to Equational MatingsPublished by Elsevier ,1989
- The Church-Rosser property for ground term-rewriting systems is decidableTheoretical Computer Science, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- About the rewriting systems produced by the Knuth-Bendix completion algorithmInformation Processing Letters, 1983
- Theorem Proving via General MatingsJournal of the ACM, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980
- An algorithm for reasoning about equalityCommunications of the ACM, 1978
- Tree-Manipulating Systems and Church-Rosser TheoremsJournal of the ACM, 1973