Implementation of a general completion procedure parameterized by built-in theories and strategies
- 1 January 1985
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Implementation of a general completion procedure parameterized by built-in theories and strategiesLecture Notes in Computer Science, 1985
- Completion of a set of rules modulo a set of equationsPublished by Association for Computing Machinery (ACM) ,1984
- Computer experiments with the REVE term rewriting system generatorPublished by Association for Computing Machinery (ACM) ,1983
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.Published by Elsevier ,1970