Matrix interpretations for proving termination of term rewriting

Journal of Automated Reasoning

Volumn 40, Issue 2-3, 2008, Pages 195-220

  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

Matrix interpretations; Satisfiability; Term rewriting; Termination

Indexed keywords

FORMAL LOGIC;

BOOLEAN SATISFIABILITY PROBLEMS; DEPENDENCY PAIRS; MATRIX COEFFICIENTS; MATRIX INTERPRETATIONS; SATISFIABILITY; TERM REWRITING; TERMINATION; WELL-FOUNDED ORDERINGS;

MATRIX ALGEBRA;

EID: 48949089786     PISSN: 01687433     EISSN: 15730670     Source Type: Journal    
DOI: 10.1007/s10817-007-9087-9     Document Type: Conference Paper

References (20)

1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theor. Comp. Sci. 236, 133-178 (2000)
2. Termination problems data base. http://www.lri.fr/~marche/tpdb/
3. Termination competition. http://www.lri.fr/~marche/termination- competition/
4. Dershowitz, N.: Termination of linear rewriting systems. In: Even, S., Kariv, O. (eds.) Proc. 8th Int. Coll. on Automata, Languages and Programming (ICALP-81). Lecture Notes in Computer Science, vol. 115, pp. 448-458. Springer (1981)
5. Eén, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) Proc. 8th Int. Conf. Theory and Applications of Satisfiability Testing SAT 2005. Lecture Notes in Computer Science, vol. 3569, pp. 61-75. Springer (2005). Tool: http://www.cs.chalmers.se/Cs/Research/FormalMethods/MiniSat/
6. Endrullis, J., Waldmann, J., Zantema, H.:Matrix interpretations for proving termination of term rewriting. In: Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR '06). Lecture Notes in Computer Science, vol. 4130, pp. 574-588. Springer (2006)
7. Giesl, J., Schneider-Kamp, P., Thiemann, R.: Aprove 1.2: automatic termination proofs in the dependency pair framework. In: Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR '06). Lecture Notes in Computer Science, vol. 4130, pp. 281- 286. Springer (2006)
8. Giesl, J., Thiemann, R., Schneider-Kamp, P.: The dependency pair framework: combining techniques for automated termination proofs. In: Proceedings of the 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2004). Lecture Notes in Computer Science, vol. 3452, pp. 301-331. Springer (2005)
9. Hirokawa, N., Middeldorp, A.: Dependency pairs revisited. In: van Oostrom, V. (ed.) Proceedings of the 15th Conference on Rewriting Techniques and Applications (RTA). Lecture Notes in Computer Science, vol. 3091, pp. 249-268. Springer (2004)
10. Hirokawa, N., Middeldorp, A.: Automating the dependency pair method. Inf. Comput. 199, 172-199 (2005)
11. Hirokawa, N., Middeldorp, A.: Tyrolean termination tool. In: Giesl, J. (ed.) Proceedings of the 16th Conference on Rewriting Techniques and Applications (RTA). Lecture Notes in Computer Science, vol. 3467, pp. 175-184. Springer (2005)
12. Hirokawa, N., Middeldorp, A.: Uncurrying for termination. In: Proceedings of 3rd International Workshop on Higher-Order Rewriting (HOR), pp. 19-24. (2006)
13. Hofbauer, D., Lautemann, C.: Termination proofs and the length of derivations (preliminary version). In: Dershowitz, N. (ed.) Proceedings of the 3rd Conference on Rewriting Techniques and Applications (RTA). Lecture Notes in Computer Science, vol. 355, pp, 167-177. Springer (1989)
14. Hofbauer, D., Waldmann, J.: Proving termination with matrix interpretations. In: Pfenning, F. (ed.) Proceedings of the 17th Conference on Rewriting Techniques and Applications (RTA). Lecture Notes in Computer Science, vol. 4098, pp. 328-342. Springer (2006)
15. Hofbauer, D., Waldmann, J.: Termination of {aa→bc, bb→ac, cc→ab}. Inf. Process. Lett. 98(4), 156-158 (2006)
16. The RTA list of open problems. http://www.lsv.ens-cachan.fr/rtaloop/
17. Full results of Jambox. http://joerg.endrullis.de/jar07/
18. Zantema, H.: Termination of term rewriting: interpretation and type elimination. J. Symb. Comput. 17, 23-50 (1994)
19. Zantema, H.: Termination. In: Term Rewriting Systems, by Terese, pp. 181-259. Cambridge University Press (2003)
20. Zantema, H.: Reducing right-hand sides for termination. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity: Essays Dedicated to Jan Willem Klop on the Occasion of His 60th Birthday. Lecture Notes in Computer Science, vol. 3838, pp. 173-197. Springer (2005)