Path orderings, quasi-orderings and termination of term rewriting systems
Cristina Borralleras, Alberto Rubio Gimeno · 1997
In this paper we present some original variations of the recursive path ordering. Additionally we define a restricted semantic path ordering which, in general, does not include the subterm relation, but is shown to be monotonic. By combining both kind of orderings we can prove (automatically) the termination of several (non-simply terminating) examples.