Abstract. Polynomial interpretations and RPO-like orderings allow one
to prove termination of Associative and Commutative (AC-)rewriting
by only checkingthe rules of the given rewrite system. However, these
methods have important limitations as termination provingto ols.
To overcome these limitations, more powerful methods ...»»»»
Abstract. Polynomial interpretations and RPO-like orderings allow one
to prove termination of Associative and Commutative (AC-)rewriting
by only checkingthe rules of the given rewrite system. However, these
methods have important limitations as termination provingto ols.
To overcome these limitations, more powerful methods like the dependency
pair method have been extended to the AC-case. Unfortunately,
in order to ensure AC-termination, the so-called extended rules, which,
CA gpApirμj rip hrio nO RiO/pj >skn bp roopo nO nhp ipwiCnp kaknp>.
In this paper we present a fully monotonic AC-compatible semantic path
ordering. This monotonic AC-orderingdefines a new automatable termination
provingmetho d for AC-rewritingwhic h does not need to consider
extended rules. As a hint of the power of this method, we can easily prove
several non-trivial examples appearingin the literature, includingone
that, to our knowledge, can be handled by no other automatic method.^^^^