SAT solving for argument filterings

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

Volumn 4246 LNAI, Issue , 2006, Pages 30-44

  Codish, Michael ^a   Schneider Kamp, Peter ^b   Lagoon, Vitaly ^c   Thiemann, René ^b   Giesl, Jürgen ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b RWTH AACHEN UNIVERSITY   (Germany)

^c UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ENCODING (SYMBOLS); PROBLEM SOLVING; THEOREM PROVING;

DEPENDENCY PAIR METHODS; PREPOSITIONAL FORMULAS; REWRITE SYSTEMS; SAT SOLVING;

COMPUTATIONAL METHODS;

EID: 33845214865     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11916277_3     Document Type: Conference Paper

References (25)

1. Annual International Competition of Termination Tools, http://www.lri.fr/marche/termination-competition.
2. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133-178, 2000.
3. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge, 1998.
4. C. Borralleras. Ordering-based methods for proving termination automatically. PhD thesis, Universitat Politècnica de Catalunya, Spain, 2003.
5. M. Codish, V. Lagoon, and P. J. Stuckey. Solving partial order constraints for LPO termination. In Proc. RTA '06, LNCS 4098, pages 4-18, 2006.
6. H. Comon, P. Narendran, R. Nieuwenhuis, and M. Rusinowitch. Decision problems in ordered rewriting. In Proc. LICS '98, pages 276-286, 1998.
7. N. Dershowitz. Termination of rewriting. J. Symb. Comput., 3(1,2):69-116, 1987.
8. N. Eén and N. Sörensson. An extensible SAT-solver. In Proc. SAT '03, LNCS 2919, pages 502-518, 2004.
9. Empirical evaluation of "SAT Solving for Argument Filterings". http://aprove.Informatik.rwth-aachen.de/eval/SATLPO.
10. T. Genet and I. Gnaedig. Termination proofs using GPO Ordering constraints with shared term data structure. In Proc. TAPSOFT '97, LNCS 1214, pp. 249-260, 1997.
11. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke, Improving dependency pairs. In Proc. LPAR '03, LNAI 2850, pages 165-179, 2003.
12. J. Giesl, R. Thiemann, and P. Schneider-Kamp. The dependency pair framework: Combining techniques for automated termination proofs. In Proc. LPAR '04, LNAI 3452, pages 301-331, 2005.
13. J. Giesl, R. Thiemann, and P. Schneider-Kamp. Proving and disproving termination of higher-order functions. In Proc. FroCoS '05, LNAI 3717, pp. 216-231, 2005.
14. J. Giesl, P. Schneider-Kamp, and R. Thiemann. AProVE 1.2: Automatic termination proofs in the DP framework. Proc. IJCAR '06, LNAI 4130, pp. 281-286, 2006.
15. N. Hirokawa and A. Middeldorp. Tsukuba Termination Tool. In Proc. RTA '03, LNCS 2706, pages 311-320, 2003.
16. N. Hirokawa and A. Middeldorp. Dependency pairs revisited. In Proc. RTA '04, LNCS 3091, pages 249-268, 2004.
17. N. Hirokawa and A. Middeldorp. Automating the dependency pair method. Information and Computation, 199(1,2):172-199, 2005.
18. N. Hirokawa and A. Middeldorp. Tyrolean Termination Tool. In Proc. RTA '05, LNCS 3467, pages 175-184, 2005.
19. S. Kamin and J. J. Levy. Two generalizations of the recursive path ordering. Unpublished Manuscript, University of Illinois, IL, USA, 1980.
20. M. Kurihara and H. Kondo. Efficient BDD encodings for partial order constraints with application to expert systems in software verification. In Proc. IEA/AIE '04, LNCS 3029, pages 827-837, 2004.
21. K. Kusakari, M. Nakamura, and Y. Toyama. Argument filtering transformation. In Proc. PPDP '99, LNCS 1702, pages 47-61, 1999.
22. SAT4J satisfiability library for Java, http://www.sat4j.org.
23. R. Thiemann, J. Giesl, and P. Schneider-Kamp. Improved modular termination proofs using dependency pairs. In Proc. IJCAR '04, LNAI 3097, pages 75-90, 2004
24. G. Tseitin. On the complexity of derivation in prepositional calculus. In Studies in Constructive Mathematics and Mathematical Logic, pages 115-125. 1968.
25. Reprinted in J. Siekmann and G. Wrightson (editors), Automation of Reasoning, vol. 2, pages 466-483, Springer, 1983.