Improved matrix interpretation

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

Volumn 5901 LNCS, Issue , 2010, Pages 283-295

  Courtieu, Pierre ^a   Gbedo, Gladys ^a   Pons, Olivier ^a  

^a CEDRIC CNAM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

GENERALISATION; INTEGER MATRICES; MATRIX; NATURAL NUMBER; NON-LINEAR; SEARCH SPACES; STRING REWRITING; TERM REWRITING; TERM REWRITING SYSTEMS; WELL-FOUNDED ORDERINGS;

COMPUTER SCIENCE; POLYNOMIALS;

MATRIX ALGEBRA;

EID: 77249167764     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11266-9_24     Document Type: Conference Paper

References (20)

1. Annov, E., Codish, M., Giesl, J., Schneider-Kamp, P., Thiemann, R.: A Sat-Based Implementation for rpo Termination. In: International Conference on Logic for Programming, Artificial Intelligence and Reasoning (Short Paper) (November 2006)
2. Arts, T., Giesl, J.: Termination of Term Rewriting Using Dependency Pairs. Theoretical Computer Science 236, 133-178 (2000)
3. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
4. Cherifa, A.B., Lescanne, P.: Termination of Rewriting Systems by Polynomial Interpretations and Its Implementation. Science of Computer Programming 9(2), 137-159 (1987)
5. Contejean, E., Courtieu, P., Forest, J., Pons, O., Urbain, X.: Certification of Automated Termination Proofs. In: Konev, B., Wolter, F. (eds.) FroCos 2007. LNCS (LNAI), vol. 4720, pp. 148-162. Springer, Heidelberg (2007)
6. Contejean, É;., Marché, C., Tomás, A.P., Urbain, X.: Mechanically Proving Termination Using Polynomial Interpretations. Journal of Automated Reasoning 34(4), 325-363 (2005)
7. Courtieu, P., Forest, J., Urbain, X.: Certifying a Termination Criterion Based on Graphs, without Graphs. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 183-198. Springer, Heidelberg (2008)
8. Dershowitz, N.: Orderings for Term Rewriting Systems. Theoretical Computer Science 17(3), 279-301 (1982)
9. Dershowitz, N., Jouannaud, J.-P.: Rewrite Systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 243-320. North-Holland, Amsterdam (1990)
10. 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)
11. Endrullis, J., Waldmann, J., Zantema, H.: Matrix Interpretations for Proving Termination of Term Rewriting. Jar 40(2-3), 195-220 (2008)
12. Fuhs, C., Middeldorp, A., Schneider-Kamp, P., Zankl, H.: Sat Solving for Termination Analysis with Polynomial Interpretations. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 340-354. Springer, Heidelberg (2007)
13. Geser, A.: Relative Termination. Dissertation, Fakultät für Mathematik und Informatik, Universität Passau, Germany (1990) 105 pages.
14. Also available as: Report 91-03, Ulmer Informatik-Berichte, Universität Ulm (1991)
15. Giesl, J. (ed.): RTA 2005. LNCS, vol. 3467. Springer, Heidelberg (2005)
16. Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and Improving Dependency Pairs. Journal of Automated Reasoning 37(3), 155-203 (2006)
17. Hofbauer, D., Waldmann, J.: Termination of String Rewriting with Matrix Interpretations. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 328-342. Springer, Heidelberg (2006)
18. Koprowski, A., Waldmann, J.: Arctic Termination., Below Zero. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 202-216. Springer, Heidelberg (2008)
19. Kusakari, K., Nakamura, M., Toyama, Y.: Argument Filtering Transformation. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol. 1702, pp. 47-61. Springer, Heidelberg (1999)
20. Lankford, D.S.: On Proving Term Rewriting Systems Are Noetherian. Technical Report MTP-3, Mathematics Department, Louisiana Tech. Univ. (1979), http://perso.ens-lyon.fr/pierre.lescanne/not-accessible.html