A complete proof of correctness of the Knuth-Bendix completion algorithm

https://doi.org/10.1016/0022-0000(81)90002-7Get rights and content
Under an Elsevier user license
open archive

Abstract

We give in this paper a complete description of the Knuth-Bendix completion algorithm. We prove its correctness in full, isolating carefully the essential abstract notions, so that the proof may be extended to other versions and extensions of the basic algorithm. We show that it defines a semidecision algorithm for the validity problem in the equational theories for which it applies, yielding a decision procedure whenever the algorithm terminates.

Cited by (0)

This work was partially supported by AFOSR Contract F49620-79-C-0099 and by ONR Contract N00014-75-C-0816, while the author was visiting SRI International.