Search techniques for rational polynomial orders

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

Volumn 5144 LNAI, Issue , 2008, Pages 109-124

  Fuhs, Carsten ^a   Navarro Marset, Rafael ^b   Otto, Carsten ^a   Giesl, Jürgen ^a   Lucas, Salvador ^b   Schneider Kamp, Peter ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Dependency pairs; SAT solving; Term rewriting; Termination

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; ARTIFICIAL INTELLIGENCE; BOOLEAN FUNCTIONS; CLASSIFICATION (OF INFORMATION); COMPUTER NETWORKS; INFORMATION MANAGEMENT; KNOWLEDGE MANAGEMENT; MANAGEMENT INFORMATION SYSTEMS; MATHEMATICAL TECHNIQUES;

DEPENDENCY PAIRS; RATIONAL POLYNOMIAL; SAT SOLVING; TERM REWRITING; TERMINATION;

POLYNOMIALS;

EID: 51049108618     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85110-3_10     Document Type: Conference Paper

References (20)

1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133-178 (2000)
2. Contejean. E., Marché, C., Monate, B., Urbain, X.: CiME, http://cime.lri.fr
3. Contejean, E., Marché, C., Tomás, A.P., Urbain, X.: Mechanically proving termination using polynomial interpretations. Journal of Automated Reasoning 34(4), 325-363 (2005)
4. Dershowitz, N.: Termination of rewriting. Journal of Symbolic Computation 3, 69-116 (1987)
5. Endrullis, J.: Jambox. http://joerg.endrullis.de
6. 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)
7. Fuhs, C., Giesl, J., Middeldorp, A., Thiemann, R., 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)
8. Gebhardt, A., Hofbauer, D., Waldmann, J.: Matrix Evolutions. In: Proc. WST 2007 (2007)
9. Giesl, J., Thiemann, R., Schneider-Kamp, P.: The dependency pair framework: Combining techniques for automated termination proofs. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 301-331. Springer. Heidelberg(2005)
10. Giesl, J., Schneider-Kamp, P., Thiemann. R.: AProVE 1.2: Automatic termination proofs in the DP framework. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 281-286. Springer, Heidelberg (2006)
11. Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and improving dependency pairs. Journal of Automated Reasoning 37(3), 155-203 (2006)
12. Hirokawa. N., Middeldorp, A.: Automating the dependency pair method. Information and Computation 199(1,2), 172-199 (2005)
13. Hirokawa, N., Middeldorp, A.: Tyrolean Termination Tool: Techniques and features. Information and Computation 205(4), 474-511 (2007)
14. Hong, H., Jakuš, D.: Testing positiveness of polynomials. Journal of Automated Reasoning 21(1), 23-38 (1998)
15. Lucas. S.: MU-TERM: a tool for proving termination of context-sensitive rewriting. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 200-209. Springer, Heidelberg (2004)
16. Lucas, S.: Polynomials over the reals in proofs of termination: From theory to practice. RAIRO Theoretical Informatics and Applications 39(3), 547-586 (2005)
17. Lucas, S.: On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting. Applicable Algebra in Engineering, Communication and Computing 17(1), 49-73 (2006)
18. Lucas, S.: Practical use of polynomials over the reals in proofs of termination. In: Proc. PPDP 2007, pp. 39-50. ACM Press. New York (2007)
19. Marché, C. Zantema, H.: The termination competition. In: Baader. F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 303-313. Springer. Heidelberg (2007)
20. Thiemann, R., Middeldorp, A.: Innermost termination of rewrite systems by labeling. In: Proc. WRS 2007. ENTCS 204, pp. 3-19 (2008)