Termination by quasi-periodic interpretations

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

Volumn 4533 LNCS, Issue , 2007, Pages 404-418

  Zantema, Hans ^a   Waldmann, Johannes ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b LEIPZIG UNIVERSITY OF APPLIED SCIENCES   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; LOGIC PROGRAMMING; NUMBER THEORY;

NATURAL NUMBERS; STRING REWRITING; TERM REWRITING;

COMPUTER SCIENCE;

EID: 38049178758     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73449-9_30     Document Type: Conference Paper

References (14)

1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133-178 (2000)
2. Termination Problems Data Base http://www.lri.fr/~marche/tpdb/
3. Eén, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61-75. Springer, Heidelberg (2005) Tool:http://www.cs. Chalmers.se/Cs/Research/FormalMethods/MiniSat/
4. Endrullis, J., Waldmann, J., Zantema, H.: Matrix interpretations for proving termination of term rewriting. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 574-588. Springer, Heidelberg (2006)
5. Geser, A.: Termination of string rewriting rules that have one pair of overlaps. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol. 2706, pp. 410-423. Springer, Heidelberg (2003)
6. Geser, A., Hofbauer, D., Waldmann, J., Zantema, H.: Finding finite automata that certify termination of string rewriting. International Journal of Foundations of Computer Science 16(3), 471-486 (2005)
7. Giesl, J., Arts, T., Ohlebusch, E.: Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation 34(1), 21-58 (2002)
8. Hofbauer, D., Waldmann, J.: Proving termination with matrix interpretations. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 328-342. Springer, Heidelberg (2006)
9. Marché, C., Zantema, H.: The termination competition. In: Baader, F. (ed.) Proceedings of the 18th Conference on Rewriting Techniques and Applications (RTA), Springer, Heidelberg (2007) http://www.lri.fr/~marche/ termination-competition/
10. Moczydlowski, W., Geser, A.: Termination of single-threaded one-rule Semi-Thue systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 338-352. Springer, Heidelberg (2005)
11. Zantema, H.: Termination of term rewriting by semantic labelling. Fundamenta Informaticae 24, 89-105 (1995)
12. Zantema, H.: Termination. In: Term Rewriting Systems, by Terese, pp. 181-259. Cambridge University Press, Cambridge (2003)
13. Zantema, H.: Termination of string rewriting proved automatically. Journal of Automated Reasoning 34, 105-139 (2004)
14. s. In: Hsiang, J. (ed.) Rewriting Techniques and Applications. LNCS, vol. 914, pp. 41-55. Springer, Heidelberg (1995)