Abstract
Polynomial interpretations and RPO-like orderings allow one to prove termination of Associative and Commutative (AC-)rewriting by only checking the rules of the given rewrite system. However, these methods have important limitations as termination proving tools.
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, in general, are hard to prove, must be added to the rewrite system.
In this paper we present a fully monotonic AC-compatible semantic path ordering. This monotonic AC-ordering defines a new automatable termination proving method for AC-rewriting which does not need to consider extended rules. As a hint of the power of this method, we can easily prove several non-trivial examples appearing in the literature, including one that, to our knowledge, can be handled by no other automatic method.
Both authors partially supported by the spanish CICYT project MAVERISH ref. TIC2001-2476-C03-01 and the spanish DURSI group 2001SGR 00254.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133–178, 2000.
A. Ben-Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9:137–160, 1987.
C. Borralleras, M. Ferreira, and A. Rubio. Complete monotonic semantic path orderings. Proc. of 17th Int. Conf. on Automated Deduction, LNAI 1831:346–364, 2000.
L. Bachmair and D.A. Plaisted. Termination orderings for associative-commutative rewriting systems. Journal of Symbolic Computation, 1:329–349, 1985.
C. Borralleras and A. Rubio. A Monotonic Higher-Order Semantic Path Ordering. Proc. of 8th Int. Conf. on Logic for Programming, Artificial Intelligence and Reasoning (LPAR’01) LNAI 2250:531–547, 2001.
C. Borralleras and A. Rubio. TERMPTATION: TERMination Proof Techniques automATION. Available at http://www.lsi.upc.es/~albert/.
C. Borralleras and A. Rubio. Proving Termination of AC-rewriting without Extended Rules. Long version. Available at http://www.lsi.upc.es/~albert/.
E. Contejean, C. Marché, B. Monate and X. Urbain. CiME system. 2000. Available at http://cime.lri.fr/.
E. Contejean, C. Marché and L. Rabehasaina. Rewrite systems for natural, integral, and rational arithmetic. Proc. of 8th Int. Conf. on Rewriting Techniques and Applications, RTA’97, LNCS 1232:98–112, 1997.
N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279–301, 1982.
C. Delor and L. Puel. Extension of the associative path ordering to a chain of associative commutative symbols. Proc. of 5th Int. Conf. on Rewriting Techniques and Applications RTA’93, LNCS 690:389–404, 1993.
J. Giesl and D. Kapur. Dependency pairs for Equational Rewriting. Proc. of 12th Int. Conf. on Rewriting Techniques and Applications, RTA’01, LNCS 2051:93–108, 2001.
S. Kamin and J. J. Levy. Two generalizations of the recursive path ordering. Unpublished note, Dept. of Computer Science, Univ. of Illinois, Urbana, IL, 1980.
K. Kusakari, M. Nakamura, and Y. Toyama. Argument filtering transformation. In Proceedings of the International Conference on Principles and Practice of Declarative Programming, PPDP’99, LNCS 1702:47–61. Springer-Verlag, 1999.
D. E. Knuth. The Art of Computer Programming. Vol. 2: Seminumerical Algorithms. Third Edition. Addison-Wesley, 1997.
D. Kapur and G. Sivakumar. Proving Associative-Commutative Termination Using RPO-compatible Orderings. In Proc. Automated Deduction in Classical and Non-Classical Logics, LNAI 1761:40–62, 2000.
D. Kapur, G. Sivakumar and H. Zhang. A Path Ordering for Proving Termination of AC Rewrite Systems. In Journal of Automated Reasoning, 14(2):293–316, 1995.
K. Kusakari and Y. Toyama. On provingA C-termination by AC-dependency pairs. IEICE Transactions on Information and Systems, E84-D(5):604–612, 2001.
C. Marché and X. Urbain. Termination of associative-commutative rewriting by dependency pairs. Proc. of 9th Int. Conf. on Rewriting Techniques and Applications, RTA’98, LNCS 1379:241–255, 1998.
A. Rubio and R. Nieuwenhuis. A total AC-compatible ordering based on RPO Theoretical Computer Science, 142(2):209–227, 1995.
A. Rubio. A fully syntactic AC-RPO. Information and Computation, 178(2):515–533, 2002.
X. Urbain. Approche incrémentale des preuves automatiques de terminaison. PhD thesis, Université Paris-Sud, UFR Scientifique d’Orsay, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borralleras, C., Rubio, A. (2003). Monotonic AC-Compatible Semantic Path Orderings. In: Nieuwenhuis, R. (eds) Rewriting Techniques and Applications. RTA 2003. Lecture Notes in Computer Science, vol 2706. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44881-0_20
Download citation
DOI: https://doi.org/10.1007/3-540-44881-0_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40254-1
Online ISBN: 978-3-540-44881-5
eBook Packages: Springer Book Archive