A complete proof of correctness of the Knuth-Bendix completion algorithm
- 1 August 1981
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 23 (1), 11-21
- https://doi.org/10.1016/0022-0000(81)90002-7
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- 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
- A Catalogue of Canonical Term Rewriting Systems.Published by Defense Technical Information Center (DTIC) ,1980