Abstract
We present the first fully syntactic (i.e., non-interpretationbased) AC-compatible recursive path ordering (RPO). It is simple, and hence easy to implement, and its behaviour is intuitive as in the standard RPO. The ordering is AC-total, and defined uniformly for both ground and non-ground terms, as well as for partial precedences. More importantly, it is the first one that can deal incrementally with partial precedences, an aspect that is essential, together with its intuitive behaviour, for interactive applications like Knuth-Bendix completion.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
L. Bachmair. Associative-commutative reduction orderings. Information Processing Letters, 43:21–27, 1992.
A. Ben-Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming, 9:137–160, 1987.
L. Bachmair and D. A. Plaisted. Termination orderings for associativecommutative rewriting systems. J. of Symbolic Comput., 1:329–349, 1985.
H. Comon, R. Nieuwenhuis, and A. Rubio. Orderings, AC-Theories and Symbolic Constraint Solving. In 10th Annual IEEE Symp. on Logic in Computer Science, pp. 375–385, San Diego, 1995. IEEE Comput. Society Press.
N. Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17(3):279–301, 1982.
N. Dershowitz, J. Hsiang, A. Josephson, and D. Plaisted. Associativecommutative rewriting. In Int. Joint Conf. on Artificial Inteligence, pp. 940–944, 1983.
C. Delor and L. Puel. Extension of the associative path ordering to a chain of associative commutative symbols. In 5th Int. Conf. on Rewriting Techniques and Applications, LNCS 690, pp. 389–404, Montreal, 1993. Springer-Verlag.
I. Gnaedig and P. Lescanne. Proving termination of associative-commutative rewrite systems by rewriting. In 8th International Conference on Automated Deduction, LNCS 230, pp. 52–61, Oxford, England, 1986. Springer-Verlag.
D. Kapur and G. Sivakumar. A total, ground path ordering for proving termination of ac-rewrite systems. In 8th InternationalConference on Rewriting Techniques and Applications, LNCS 1232, Sitges, Spain, 1997.
D. Kapur and G. Sivakumar. A recursive path ordering for proving associative-commutative termination, 1998.
D. Kapur, G. Sivakumar and H. Zhang. A new method for proving termination of ac-rewrite systems. In Conf. Found. of Soft. Technology and Theor. Comput. Science, LNCS 472, pp. 134–148, New Delhi, 1990. Springer-Verlag.
P. Narendran and M. Rusinowitch. Any ground associative commutative theory has a finite canonical system. In 4th Int. Conf. on Rewriting Techniques and Applications, LNCS 488, pp. 423–434, Como, 1991. Springer-Verlag.
A. Rubio and R. Nieuwenhuis. A total AC-compatible ordering based on RPO. Theoretical Computer Science, 142(2):209–227, 1995.
A. Rubio. A total AC-compatible ordering with RPO scheme. Technical Report UPC-LSI-97, Univ. Polit. Catalunya, September 1997.
A. Rubio. A fully syntactic AC-RPO. Technical Report UPC-LSI-98, Univ. Polit. Catalunya,December 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rubio, A. (1999). A Fully Syntactic AC-RPO. In: Narendran, P., Rusinowitch, M. (eds) Rewriting Techniques and Applications. RTA 1999. Lecture Notes in Computer Science, vol 1631. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48685-2_11
Download citation
DOI: https://doi.org/10.1007/3-540-48685-2_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66201-3
Online ISBN: 978-3-540-48685-5
eBook Packages: Springer Book Archive