Matrix interpretations for proving termination of term rewriting

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

Volumn 4130 LNAI, Issue , 2006, Pages 574-588

  Endrullis, Jörg ^a   Waldmann, Johannes ^b   Zantema, Hans ^c  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b LEIPZIG UNIVERSITY OF APPLIED SCIENCES   (Germany)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; CONFORMAL MAPPING; DATABASE SYSTEMS; FINITE AUTOMATA; NUMBER THEORY; PROBLEM SOLVING; TEXT PROCESSING;

BOOLEAN SATISFIABILITY PROBLEM; MATRIX INTERPRETATIONS; TERM REWRITING; TERMINATION;

MATRIX ALGEBRA;

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

References (16)

1. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133-178, 2000.
2. Termination Competition. http://www.lri.fr/~marche/termination- competition/.
3. N. Eén and A. Biere. Effective preprocessing in sat through variable and clause elimination. In F. Bacchus and T. Walsh, editors, Proc. 8th Int. Conf. Theory and Applications of Satisfiability Testing SAT 2005, volume 3569 of Lecture Notes in Computer Science, pages 61-75, Berlin, 2005. Springer-Verlag.
4. J. Endrullis. Jarnbox: Automated termination proofs for string rewriting. http://joerg.endrullis.de/, 2005.
5. J. Giesl, R. Thiemann, and P. Schneider-Kamp. The dependency parr framework: Combining techniques for automated termination proofs. In Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2004), volume 3452 of Lecture Notes in Computer Science, pages 301-331. Springer, 2005.
6. J. Giesl, R. Thiemann, and P. Schneider-Kamp. Proving and disproving termination of higher-order functions. In Proceedings of the 5th International Workshop on Frontiers of Combining Systems (FroCoS 2005), volume 3717 of Lecture Notes in Computer Science, pages 216-231. Springer, 2005.
7. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Automated termination proofs with AProVE. In V. van Oostrom, editor, Proceedings of the 15th Conference on Rewriting Techniques and Applications (RTA), volume 3091 of Lecture Notes in Computer Science, pages 210-220. Springer, 2004.
8. N. Hirokawa and A. Middeldorp. Dependency pairs revisited. In V. van Oostrom, editor, Proceedings of the 15th Conference on Rewriting Techniques and Applications (RTA), volume 3091 of Lecture Notes in Computer Science, pages 249-268. Springer, 2004.
9. N. Hirokawa and A. Middeldorp. Automating the dependency pair method. Information and Computation, 199:172-199, 2005.
10. N. Hirokawa and A. Middeldorp. Tyrolean termination tool. In J. Giesl, editor, Proceedings of the 16th Conference on Rewriting Techniques and Applications (RTA), volume 3467 of Lecture Notes in Computer Science, pages 175-184. Springer, 2005.
11. D. Hofbauer and J. Waldmann. Proving termination with matrix interpretations. In F. Pfenning, editor, Proceedings of the 17th Conference on Rewriting Techniques and Applications (RTA), Lecture Notes in Computer Science. Springer, 2006.
12. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference DAC 2001, pages 530-535. ACM, 2001.
13. J. Waldmann. Matchbox: A tool for match-bounded string rewriting. In V. van Oostrom, editor, Proceedings of the 15th Conference on Rewriting Techniques and Applications (RTA), pages 85-94, Berlin, 2004. Springer-Verlag.
14. H. Zantema. Termination of term rewriting: Interpretation and type elimination. Journal of Symbolic Computation, 17:23-50, 1994.
15. H. Zantema. Termination. In Term Rewriting Systems, by Terese, pages 181-259. Cambridge University Press, 2003.
16. H. Zantema. Reducing right-hand sides for termination. In A. Middeldorp, V. van Oostrom, F. van Raamsdonk, and R. de Vrijer, editors, Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday, volume 3838 of Lecture Notes in Computer Science, pages 173-197, Berlin, 2005. Springer-Verlag.