Add to ORKGA new path ordering for showing termination of associative-commutative (AC) rewrite systems is defined. If the precedence relation on function symbols is total, the ordering is total on ground terms, but unlike the ordering proposed by Rubio and Nieuwenhuis, this ordering can orient the distributivity property in the proper direction. The ordering is defined in a natural way using recursive path ordering with status as the underlying basis. This settles a longstanding problem in termination orderings for AC rewrite systems. The ordering can be used to define an ordering on nonground terms
In the first part this paper gives an order-theoretic analysis of the multiset ordering, the recursi...
AbstractThis paper extends the termination proof techniques based on rewrite orderings to a higher-o...
This survey describes methods for proving that systems of rewrite rules are terminating programs. We...
Developing path orderings for associative-commutative (AC) rewrite systems has been quite a challeng...
In this paper we describe a new class of orderings—associative path orderings—for proving terminatio...
In this paper we describe a new class of orderings—associative path orderings—for proving terminatio...
In this paper we describe a new class of orderings—associative path orderings—for proving terminatio...
In this paper we describe a new class of orderings—associative path orderings—for proving terminatio...
Abstract. Polynomial interpretations and RPO-like orderings allow one to prove termination of Assoc...
Term rewriting systems provide a simple mechanism for computing in equations. An equation is convert...
Rewrite systems are sets of directed equations used to compute by repeatedly replacing subterms in a...
Term rewriting systems provide a simple mechanism for computing in equations. An equation is convert...
In the first part this paper gives an order-theoretic analysis of the multiset ordering, the recursi...
In the first part this paper gives an order-theoretic analysis of the multiset ordering, the recursi...
In this paper we investigate the concept of simple termination. A term rewriting system is called si...
In the first part this paper gives an order-theoretic analysis of the multiset ordering, the recursi...
AbstractThis paper extends the termination proof techniques based on rewrite orderings to a higher-o...
This survey describes methods for proving that systems of rewrite rules are terminating programs. We...
Developing path orderings for associative-commutative (AC) rewrite systems has been quite a challeng...
In this paper we describe a new class of orderings—associative path orderings—for proving terminatio...
In this paper we describe a new class of orderings—associative path orderings—for proving terminatio...
In this paper we describe a new class of orderings—associative path orderings—for proving terminatio...
In this paper we describe a new class of orderings—associative path orderings—for proving terminatio...
Abstract. Polynomial interpretations and RPO-like orderings allow one to prove termination of Assoc...
Term rewriting systems provide a simple mechanism for computing in equations. An equation is convert...
Rewrite systems are sets of directed equations used to compute by repeatedly replacing subterms in a...
Term rewriting systems provide a simple mechanism for computing in equations. An equation is convert...
In the first part this paper gives an order-theoretic analysis of the multiset ordering, the recursi...
In the first part this paper gives an order-theoretic analysis of the multiset ordering, the recursi...
In this paper we investigate the concept of simple termination. A term rewriting system is called si...
In the first part this paper gives an order-theoretic analysis of the multiset ordering, the recursi...
AbstractThis paper extends the termination proof techniques based on rewrite orderings to a higher-o...
This survey describes methods for proving that systems of rewrite rules are terminating programs. We...