Constraints for argument filterings

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

Volumn 4362 LNCS, Issue , 2007, Pages 579-590

  Zankl, Harald ^a   Hirokawa, Nao ^a   Middeldorp, Aart ^a  

^a UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); FORMAL LOGIC; PROBLEM SOLVING;

ARGUMENT FILTERINGS; PROPOSITIONAL LOGIC; REWRITE SYSTEMS;

CONSTRAINT THEORY;

EID: 35148900632     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69507-3_50     Document Type: Conference Paper

References (15)

1. Arts, T. and Giesl, J.: Termination of Term Rewriting Using Dependency Pairs. Theoretical Computer Science 236 (2000) 133-178
2. Baader, F. and Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)
3. Codish, M., Lagoon, V., and Stuckey, P.: Solving Partial Order Constraints for LPO Termination. In Proc. of the 17th International Conference on Rewriting Techniques and Applications, LNCS 4098 (2006) 4-18
4. Codish, M., Schneider-Kamp, P., Lagoon, V., Thiemann, R., and Giesl, J.: Automating Dependency Pairs Using SAT Solvers. In Proc. of the 8th International Workshop on Termination (2006) 60-63 Extended version to appear in Proc. of the 13th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LNCS (2006)
5. Eén, N. and Sörensson, N.: An Extensible SAT-Solver. In Proc. of the 6th International Conference on Theory and Applications of Satisfiability Testing, LNCS 2919 (2004) 502-518
6. Giesl, J., Arts, T., and Ohlebusch, E.: Modular Termination Proofs for Rewriting Using Dependency Pairs. Journal of Symbolic Computation 34 1 (2002) 21-58
7. Giesl, J., Schneider-Kamp, P., and Thiemann, R.: AProVE 1.2: Automatic Termination Proofs in the Dependency Pair Framework. In Proc. of the 3rd International Joint Conference on Automated Reasoning, LNAI (2006) 281-286
8. Hirokawa, N. and Middeldorp, A.: Dependency Pairs Revisited. In Proc. of the 15th International Conference on Rewriting Techniques and Applications, LNCS 3091 (2004) 249-268
9. Hirokawa, N. and Middeldorp, A.: Automating the Dependency Pair Method. Information and Computation 199 1,2 (2005) 172-199
10. Hirokawa, N. and Middeldorp, A.: Tyrolean Termination Tool. In Proc. of the 16th International Conference on Rewriting Techniques and Applications, LNCS 3467 (2005) 175-184
11. Kurihara, M. and Kondo, H.: Efficient BDD Encodings for Partial Order Constraints with Application to Expert Systems in Software Verification. In Proc. of the 17th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, LNCS 3029 (2004) 827-837
12. Thiemann, R., Giesl, J., and Schneider-Kamp, P.: Improved Modular Termination Proofs Using Dependency Pairs. In Proc. of the 2nd International Joint Conference on Automated Reasoning, LNAI 3097 (2004) 75-90
13. Zankl, H.: BDD and SAT Techniques for Precedence Based Orders. Master's Thesis, University of Innsbruck (2006) Available at http://cl-informatik.uibk. ac.at/HZ.pdf
14. Zankl, H., Hirokawa, N., and Middeldorp, A.: Constraints for Argument Filterings. In Proc. of the 8th International Workshop on Termination (2006) 50-54
15. Zankl, H. and Middeldorp, A.: KBO as a Satisfaction Problem. In Proc. of the 8th International Workshop on Termination (2006) 55-59 Full version available at http ://arxiv.org/abs/cs.SC/0608032