Completion for rewriting modulo a congruence
- 1 January 1987
- book chapter
- Published by Springer Nature
- p. 192-203
- https://doi.org/10.1007/3-540-17220-3_17
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Completion of a Set of Rules Modulo a Set of EquationsSIAM Journal on Computing, 1986
- Critical-pair criteria for the Knuth-Bendix completion procedurePublished by Association for Computing Machinery (ACM) ,1986
- Confluent and coherent equational term rewriting systems application to proofs in abstract data typesPublished by Springer Nature ,1983
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- A Catalogue of Canonical Term Rewriting Systems.Published by Defense Technical Information Center (DTIC) ,1980