Termination orderings for associative-commutative rewriting systems (Q1072371): Difference between revisions

In this paper we describe a new class of orderings - associative path orderings - for proving termination of associative-commutative term rewriting systems. These orderings are based on the concept of simplification orderings and extend the well-known recursive path orderings to E-congruence classes, where E is an equational theory consisting of associativity and commutativity axioms. Associative path orderings are applicable to term rewriting systems for which a precedence ordering on the set of operator symbols can be defined that satisfies a certain condition, the associative path condition. These precedence ordering can often be derived from the structure of the reduction rules. We include termination proofs for various term rewriting systems (for rings, Boolean algebra, etc.) and, in addition, point out ways to handle situations where the associative path condition is too restrictive.