On dealing with divergent rewrite systems

Knuth-Bendix completion is a well-known technique to produce a canonical term rewriting system from a given set T of equations. One of the major problems in this approach is that Knuth-Bendix completion can result in an infinite set of rewrite rules. This problem has been well studied and various approaches that try to cope with infinite sets of rules have been proposed. In this abstract we present a different way of dealing with divergent term rewriting systems.