Abstract
The effective computation with term rewriting systems modulo a theory E presumes E-termination. We will give a classification of the methods guaranteeing AC-termination based on the recursive path ordering. Furthermore, we will show that these techniques [called associative path orderings] cannot use quasi-orderings on operators. Above all, this report will deal with two new orderings applicable to AC-theories. We apply the concept of the associative path ordering to the recursive path ordering with status [RPOS] and the improved recursive decomposition ordering with status [IRDS]. Since these orderings are stronger than the recursive path ordering, the corresponding orderings restricted to AC-theories are more powerful than the associative path ordering. From a practical point of view the associative-commutative IRDS is more interesting than the associative path ordering because the detection of an admissible precedence for orienting the rules of a given system is easier.
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 research was supported by the Deutsche Forschungsgemeinschaft. SFB 314
Preview
Unable to display preview. Download preview PDF.
References
Ahlem Ben Cherifa / Pierre Lescanne: Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming 9 [2], October 1987, pp. 137–160
Leo Bachmair / David A. Plaisted: Termination orderings for associative-commutative rewriting systems, Journal of Symbolic Computation 1, 1985, pp. 329–349
Ghislaine Choque: How to compute a complete set of minimal incrementations with the recursive decomposition ordering?, Internal Report 84-R-056, Centre de Recherche en Informatique de Nancy, Nancy, France, 1984
Max Dauchet: Termination of rewriting is undecidable in the one-rule case, Proc. 13th Symposium of MFCS, Carlsbad, CSSR, September 1988, LNCS 324, pp. 262–270
Nachum Dershowitz: Termination of rewriting, Journal of Symbolic Computation 3, 1987, pp. 69–116
Nachum Dershowitz / Jieh Hsiang / N. Alan Josephson / David A. Plaisted: Associative-commutative rewriting, Proc. 8th Int. Joint Conf. on Artificial Intelligence, Karlsruhe, W. Germany, August 1983, pp. 940–944
Isabelle Gnaedig / Pierre Lescanne: Proving termination of associative-commutative rewriting systems by rewriting, Proc. 8th Conf. on Automated Deduction, Oxford, U.K., 1986, LNCS 230, pp. 52–60
Jean-Pierre Jouannaud / Helene Kirchner: Completion of a set of rules modulo a set of equations, SIAM Journal of Computing 15 [4], 1986, pp. 1155–1194
Jean-Pierre Jouannaud / Pierre Lescanne / Fernand Reinig: Recursive decomposition ordering, IFIP Working Conf. on Formal Description of Programming Concepts II [D. Bjørner, ed.], Garmisch-Partenkirchen, W. Germany, 1982, pp. 331–348
Jean-Pierre Jouannaud / Miguel Munoz: Termination of a set of rules modulo a set of equations, Proc. 7th Conf. on Automated Deduction, Napa, California, 1984, LNCS 170, pp. 175–193
Donald E. Knuth / Peter B. Bendix: Simple word problems in universal algebras, Computational Problems in abstract algebra, Pergamon press, 1970, pp. 263–297
Sam Kamin / Jean-Jacques Levy: Attempts for generalizing the recursive path orderings, Unpubl. manuscript, Urbana, Illinois, 1980
Deepak Kapur / Paliath Narendran / G. Sivakumar: A path ordering for proving termination of term rewriting systems, Proc. 10th Colloquium on Trees in Algebra and Programming, Berlin, W. Germany, March 1985, LNCS 185, pp. 173–187
David A. Plaisted: A recursively defined ordering for proving termination of term rewriting systems, Internal Report, Univ. of Illinois, Urbana, U.S.A., September 1978
Gerald E. Peterson / Mark E. Stickel: Complete sets of reductions for some equational theories, Journal of the Association for Computing Machinery 28 [2], April 1981, pp. 233–264
Michael Rusinowitch: Path of subterms ordering and recursive decomposition ordering revisited, Journal of Symbolic Computation 3, 1987, pp. 117–131
Joachim Steinbach: Extensions and comparison of simplification orderings, Proc. 3rd Conf. on Rewriting Techniques and Applications, Chapel Hill, North Carolina, U.S.A., April 1989, pp. 434–448
Joachim Steinbach: Proving termination of associative-commutative rewriting systems using the Knuth-Bendix ordering, SEKI-Report, Artificial Intelligence Laboratories, Dept. of Computer Science, Univ. of Kaiserslautern, W. Germany, 1989
Joachim Steinbach: Path and decomposition orderings for proving AC-termination, SEKI-Report, Artificial Intelligence Laboratories, Dept. of Computer Science, Univ. of Kaiserslautern, W. Germany, 1989
Joachim Steinbach / Michael Zehnter: Vade-mecum of polynomial orderings, SEKI-Report, Artificial Intelligence Laboratories, Dept. of Computer Science, Univ. of Kaiserslautern, W. Germany, 1990
Michael Zehnter: Theorievollständige Ordnungen — Eine Übersicht, Project report, Univ. of Kaiserslautern, W. Germany, November 1989
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Steinbach, J. (1990). Improving associative path orderings. In: Stickel, M.E. (eds) 10th International Conference on Automated Deduction. CADE 1990. Lecture Notes in Computer Science, vol 449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52885-7_103
Download citation
DOI: https://doi.org/10.1007/3-540-52885-7_103
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52885-2
Online ISBN: 978-3-540-47171-4
eBook Packages: Springer Book Archive