A Theorem-Proving Approach to the Knuth-Bendix Completion Algorithm

The process of algebraic abstract data type completion has some similarities with resolution theorem-proving. In particular, some proof strategies developed in the field of computational logic are applicable to the Knuth-Bendix algorithm as completion strategies. Computational experiments confirm that these heuristics can indeed be employed to control, and limit, the generation of new rules during the completion process.