SAT solving for termination analysis with polynomial interpretations

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

Volumn 4501 LNCS, Issue , 2007, Pages 340-354

  Fuhs, Carsten ^a   Giesl, Jürgen ^a   Middeldorp, Aart ^b   Schneider Kamp, Peter ^a   Thiemann, René ^a   Zankl, Harald ^b  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); PROBLEM SOLVING;

AUTOMATED TERMINATION ANALYSIS; POLYNOMIAL INTERPRETATIONS;

POLYNOMIALS;

EID: 38049141479     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72788-0_33     Document Type: Conference Paper

References (26)

1. E. Annov, M. Codish, J. Giesl, P. Schneider-Kamp, and R. Thiemann. A SAT-based implementation for RPO termination. In Short Papers of LPAR '06, 2006.
2. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133-178, 2000.
3. T. Arts and J. Giesl. A collection of examples for termination of term rewriting using dependency pairs. Technical Report AIB-2001-09, RWTH Aachen, 2001.
4. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge, 1998.
5. M. Codish, V. Lagoon, and P. Stuckey. Solving partial order constraints for LPO termination. In Proc. RTA '06, LNCS 4098, p. 4-18, 2006.
6. M. Codish, P. Schneider-Kamp, V. Lagoon, R. Thiemann, and J. Giesl. SAT solving for argument filterings. In Proc. LPAR '06, LNAI 4246, p. 30-44, 2006.
7. E. Contejean, C. Marché, B. Monate, and X. Urbain. CiME. http://cime.lri.fr.
8. E. Contejean, C. Marché, A. P. Tomás, and X. Urbain. Mechanically proving termination using polynomial interpretations. J. Aut. Reason., 34(4):325-363, 2005.
9. N. Eén and N. Sörensson. An extensible SAT-solver. In Proc. SAT '03, LNCS 2919, p. 502-518, 2004.
10. Empirical evaluation of "SAT solving for termination analysis with polynomial interpretations". http://aprove.informatik.rwth-aachen.de/eval/ SATPOLO.
11. J. Endrullis, J. Waldmann, and H. Zantema. Matrix interpretations for proving termination of term rewriting. In Proc. IJCAR '06, LNAI 4130, p. 574-588, 2006.
12. J. Giesl, R. Thiemann, P. Schneider-Kamp. The DP framework: Combining Techniques for Automated Termination Proofs. LPAR'04, LNAI 3452, p.301-331, 2005.
13. J. Giesl, S. Swiderski, P. Schneider-Kamp, and R. Thiemann. Automated termination analysis for Haskell: From term rewriting to programming languages. In Proc. RTA '06, LNCS 4098, p. 297-312, 2006.
14. J. Giesl, P. Schneider-Kamp, and R. Thiemann. AProVE 1.2: Automatic termination proofs in the DP framework. Proc. IJCAR '06, LNAI 4130, p. 281-286, 2006.
15. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Mechanizing and improving dependency pairs. Journal of Automated Reasoning, 37(3): 155-203, 2006.
16. N. Hirokawa and A. Middeldorp. Automating the dependency pair method. Information and Computation, 199(1,2):172-199, 2005.
17. N. Hirokawa and A. Middeldorp. Tyrolean termination tool: Techniques and features. Information and Computation, 205(4):474-511, 2007.
18. D. Hofbauer and J. Waldmann. Termination of string rewriting with matrix interpretations. In Proc. RTA '06, LNCS 4098, p. 328-342, 2006.
19. H. Hong and D. Jakuš. Testing positiveness of polynomials. JAR, 21(1):23-38, 1998.
20. D. Lankford. On proving term rewriting systems are Noetherian. Technical Report MTP-3, Louisiana Technical University, Ruston, LA, USA, 1979.
21. D. Le Berre et al. SAT4J satisfiability library for Java, http://www.sat4j.org.
22. P. Schneider-Kamp, J. Giesl, A. Serebrenik, R. Thiemann. Automated termination analysis for logic programs by term rewriting. In Proc. LOPSTR '06, LNCS, 2007.
23. H. M. Sheini and K. A. Sakallah. Pueblo: A hybrid pseudo-boolean SAT solver. Journal on Satisfiability, Boolean Modeling and Computation, 2:61-96, 2006.
24. G. Tseitin. On the complexity of derivation in propositional calculus. In Studies in Constructive Mathematics and Mathematical Logic, p. 115-125, 1968.
25. H. Zankl, N. Hirokawa, and A. Middeldorp. Constraints for argument filterings. In Proc. SOFSEM '07, LNCS 4362, p. 579-590, 2007.
26. H. Zankl and A. Middeldorp. KBO as a satisfaction problem. Proc. WST'06, 2006.