Abstract
A technique called orderings for equational proofs is introduced for establishing completeness of equational proof theories. Methods for constructing canonical rewrite systems for equational theories are studied, and the technique is applied to the standard Knuth-Bendix completion method and to extensions of completion to rewriting modulo a congruence. Improved completion procedures and corresponding correctness proofs that are simple and intuitive are presented. Extensions of completion are described that always succeed in constructing a canonical system for a given set of equations, whenever such a system exists at all. These unfailing completion procedures may also be used for refutational theorem proving in equational theories. 22 refs.
| Original language | English |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Publisher | IEEE |
| Pages | 346-357 |
| Number of pages | 12 |
| ISBN (Print) | 0818687203 |
| State | Published - 1986 |
| Externally published | Yes |