Predictive labeling with dependency pairs using SAT

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

Volumn 4603 LNAI, Issue , 2007, Pages 410-425

  Koprowski, Adam ^a   Middeldorp, Aart ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF INNSBRUCK   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; PROBLEM SOLVING; SEMANTICS;

LEXICOGRAPHIC PATH ORDERS; PREDICTIVE LABELING; REWRITE SYSTEMS;

COMPUTER SCIENCE;

EID: 35148826029     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-73595-3_31     Document Type: Conference Paper

References (21)

1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. TCS 236, 133-178 (2000)
2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
3. Codish, M., Schneider-Kamp, P., Lagoon, V., Thiemann, R., Giesl, J.: SAT solving for argument filterings. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 30-44. Springer, Heidelberg (2006)
4. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
5. 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)
6. 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)
7. Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and improving dependency pairs. JAR 37(3), 155-203 (2006)
8. Grämlich, B.: Generalized sufficient conditions for modular termination of rewriting. AAECC 5, 131-158 (1994)
9. Hardin, T., Laville, A.: Proof of termination of the rewriting system SUBST on CCL. TCS 46(2-3), 305-312 (1986)
10. Hirokawa, N., Middeldorp, A.: Automating the dependency pair method. Information and Computation 199(1,2), 172-199 (2005)
11. Hirokawa, N., Middeldorp, A.: Predictive labeling. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 313-327. Springer, Heidelberg (2006)
12. Hirokawa, N., Middeldorp, A.: Tyrolean termination tool: Techniques and features. Information and Computation 205(4), 474-511 (2007)
13. Koprowski, A.: TPA: Termination proved automatically. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 257-266. Springer, Heidelberg (2006)
14. Koprowski, A., Zantema, H.: Automation of recursive path ordering for infinite labelled rewrite systems. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 332-346. Springer, Heidelberg (2006)
15. Lankford, D.: On proving term rewrite systems are noetherian. Technical Report MTP-3, Louisiana Technical University, Ruston, LA, USA (1979)
16. Ohlebusch, E.: On the modularity of termination of term rewriting systems. TCS 136(2), 333-360 (1994)
17. Thiemann, R., Giesl, J.: The size-change principle and dependency pairs for termination of term rewriting. AAECC 16(4), 229-270 (2005)
18. Urbain, X.: Modular &: incremental automated termination proofs. JAR 32, 315-355 (2004)
19. Zankl, H., Hirokawa, N., Middeldorp, A.: Constraints for argument filterings. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 579-590. Springer, Heidelberg (2007)
20. Zantema, H.: Termination of term rewriting by semantic labelling. Fundamenta Informaticae 24, 89-105 (1995)
21. Termination problem data base, version 3.2 (2006) http://www.lri.fr/ ~marche/tpdb