Critical pair criteria for completion
Open Access
- 31 August 1988
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 6 (1) , 1-18
- https://doi.org/10.1016/s0747-7171(88)80018-x
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Completion of a Set of Rules Modulo a Set of EquationsSIAM Journal on Computing, 1986
- Computing with rewrite systemsInformation and Control, 1985
- Refutational theorem proving using term-rewriting systemsArtificial Intelligence, 1985
- Proofs by induction in equational theories with constructorsJournal of Computer and System Sciences, 1982
- A complete proof of correctness of the Knuth-Bendix completion algorithmJournal of Computer and System Sciences, 1981
- 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
- Proving termination with multiset orderingsCommunications of the ACM, 1979
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and AssociativityJournal of the ACM, 1974