Automation of recursive path ordering for infinite labelled rewrite systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4130 LNAI, Issue , 2006, Pages 332-346

  Koprowski, Adam ^a   Zantema, Hans ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATION; NUMBER THEORY; RECURSIVE FUNCTIONS; SET THEORY; SYSTEMS ANALYSIS;

FINITE SETS; RECURSIVE PATH; RECURSIVE PATH ORDERING (RPO); TERM REWRITING SYSTEMS (TRS);

SEMANTICS;

EID: 33749598319     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814771_30     Document Type: Conference Paper

References (14)

1. The termination competition. http://www.lri.fr/~maurche/termination- competition.
2. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
3. A. B. Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Sci. Comput. Program., 9(2):137-159, 1987.
4. P.-L. Curien, T. Hardin, and A. Ríos. Strong normalization of substitutions. In Ivan M. Havel and Václav Koubek, editors, MFCS, volume 629 of Lecture Notes in Computer Science, pages 209-217. Springer, 1992.
5. N. Dershowitz. Orderings for term-rewriting systems. Theor. Comput. Sci., 17:279-301, 1982.
6. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Automated termination proofs with AProVE. In Vincent van Oostrom, editor, RTA, volume 3091 of Lecture Notes in Computer Science, pages 210-220. Springer, 2004.
7. T. Hardin and A. Laville. Proof of termination of the rewriting system SUBST on CCL. Theor. Comput. Sci., 46(2-3):305-312, 1986.
8. N. Hirokawa and A. Middeldorp. Predictive labeling. In F. Pfenning, editor, Proceedings of the 17th Conference on Rewriting Techniques and Applications (RTA), Lecture Notes in Computer Science. Springer, 2006.
9. H. Hong and D. Jakus. Testing Positiveness of Polynomials. J. Autom. Reasoning, 21(1): 23-38, 1998
10. D. Knuth and P. Bendix. Simple word problems in universal algebras. Computational Problems in Abstract Algebra, pages 263-297, 1970.
11. A. Koprowski and H. Zantema. Recursive Path Ordering for Infinite Labelled Rewrite Systems. Technical Report CS-Report 06-17, Eindhoven Univ. of Tech., April 2006.
12. H. Zantema. Termination of term rewriting by semantic labelling. Fundamenta Informaticae, 24(1/2):89-105, 1995.
13. H. Zantema. Term Rewriting Systems. Volume 55 of Cambridge Tracts in TCS, chapter 6, pages 181-259. Cambridge University Press, 2003.
14. H. Zantema. TORPA: Termination of rewriting proved automatically. In Vincent van Oostrom, editor, RTA, volume 3091 of Lecture Notes in Computer Science, pages 95-104, 2004.