Abstract
AbstractWe explore the relationship between weighted path orders and (monotonic) semantic path orders. Our findings reveal that weighted path orders can be considered instances of a variant of semantic path orders that comprise order pairs. This observation leads to a generalization of weighted path orders that does not impose simplicity on their underlying algebras. As a result, the generalized version is capable of proving termination of term rewrite systems beyond the realm of simple termination. In order to assess practicality we provide experimental data comparing generalized weighted path orders with the original ones as well as other well-known classes of reduction orders.
Publisher
Springer Nature Switzerland
Reference28 articles.
1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoret. Comput. Sci. 236, 133–178 (2000). https://doi.org/10.1016/S0304-3975(99)00207-8
2. Arts, T., Giesl, J.: A collection of examples for termination of term rewriting using dependency pairs. Tech. rep, RWTH Aachen (2001)
3. Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge Univ. Press (1998). https://doi.org/10.1017/CBO9781139172752
4. Borralleras, C.: Ordering-Based Methods for Proving Termination Automatically. Ph.D. thesis, Universitat Politècnica de Catalunya (2003)
5. Borralleras, C., Ferreira, M., Rubio, A.: Complete monotonic semantic path orderings. In: Proc. 17th International Conference on Automated Deduction. LNCS (LNAI), vol. 1831, pp. 346–364 (2000). https://doi.org/10.1007/10721959_27