## Knuth-Bendix Completion with Modern Termination Checking (2006)

### Cached

### Download Links

Venue: | |

Citations: | 5 - 1 self |

### BibTeX

@MISC{Wehrman06knuth-bendixcompletion,

author = {Ian A. Wehrman},

title = { Knuth-Bendix Completion with Modern Termination Checking},

year = {2006}

}

### OpenURL

### Abstract

Knuth-Bendix completion is a technique for equational automated theorem proving based on term rewriting. This classic procedure is parametrized by an equational theory and a (well-founded) reduction order used at runtime to ensure termination of intermediate rewriting systems. Any reduction order can be used in principle, but modern completion tools typically implement only a few classes of such orders (e.g., recursive path orders and polynomial orders). Consequently, the theories for which completion can possibly succeed are limited to those compatible with an instance of an implemented class of orders. Finding and specifying a compatible order, even among a small number of classes, is challenging in practice and crucial to the success of the method. In this thesis, a new variant on the Knuth-Bendix completion procedure is developed in which no order is provided by the user. Modern termination-checking methods are instead used to verify termination of rewriting systems. We prove the new method correct and also present an implementation called Slothrop which obtains solutions for theories that do not admit typical orders and that have not