Solving partial order constraints for LPO termination

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

Volumn 4098 LNCS, Issue , 2006, Pages 4-18

  Codish, Michael ^a   Lagoon, Vitaly ^b   Stuckey, Peter J ^b,c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF MELBOURNE   (Australia)

^c CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

BIT ERROR RATE; CODES (SYMBOLS); ENCODING (SYMBOLS); FORMAL LOGIC; MATHEMATICAL MODELS; NUMBER THEORY; PROBLEM SOLVING;

BIT REPRESENTATION; INTEGERS; PREPOSITIONAL ENCODING; TERM REWRITE SYSTEMS;

CONSTRAINT THEORY;

EID: 33749421246     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11805618_2     Document Type: Conference Paper

References (21)

1. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236(1-2):133-178, 2000.
2. Automated program verification environment (AProVe). http://www-i2. informatik.rwth-aachen.de/AProVE. Viewed December 2005.
3. M. Codish, V. Lagoon, and P. J. Stuckey. Logic programming with satisfiability, http://www.cs.bgu.ac.il/~mcodish/Papers/Sources/1psat.pdf, (submitted).
4. M. Codish, P. Schneider-Kamp, V. Lagoon, R. Thiemann, and J. Giesl. SAT solving for argument filterings. Available from http://arxiv.org/abs/cs.OH/ 0605074.
5. N. Dershowitz. Termination of rewriting. J. Symb. Comput., 3(1/2):69-116, 1987.
6. N. Dershowitz and J.-P. Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B: Formal Models and Semantics, pages 2435-320. Elsevier and MIT Press, 1990.
7. N. Eén and N. Sörensson. An extensible sat-solver. In E. Giunchiglia and A. Tacchella, editors, Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003 (Selected Revised Papers), volume 2919 of LNCS, pages 502-518. Springer, 2004.
8. J. Giesl, R. Thiemann, P. Schneider-Kamp, and S. Falke. Automated termination proofs with AProVE. In V. van Oostrom, editor, Proc. of the 15th International Conference on Rewriting Techniques and Applications, volume 3091 of LNCS, pages 210-220, Aachen, Germany, 2004. Springer.
9. N. Hirokawa and A. Middeldorp. Tsukuba termination tool. In R. Nieuwenhuis, editor, Proc. of the 14th International Conference on Rewriting Techniques and Applications, volume 2706 of LNCS, pages 311-320, Valencia, Spain, 2003.
10. N. Hirokawa and A. Middeldorp. Tyrolean termination tool. In Proc. of the 16th International Conference on Rewriting Techniques and Applications, volume 3467 of LNCS, pages 175-184, Nara, Japan, 2005. Springer.
11. S. Kamin and J.-J. Levy. Two generalizations of the recursive path ordering. Department of Computer Science, University of Illinois, Urbana, IL. Available at http://www.ens-lyon.fr/LIP/REWRITING/ OLD_PUBLICATIONS_ON_TERMINATION (viewed December 2005), 1980.
12. M. Khrishnamoorthy and P. Narendran. On recursive path ordering. Theoretical Computer Science, 40:323-328, 1985.
13. M. Kurihara and H. Kondo. Efficient BDD encodings for partial order constraints with application to expert systems in software verification. In Innovations in Applied Artificial Intelligence, 17th International Conference on Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, Proceedings, volume 3029 of LNCS, pages 827-837, Ottawa, Canada, 2004. Springer.
14. MiniSAT solver. http://www.cs.chalmers.se/Cs/Research/FormalMethods/ MiniSat.Viewed December 2005.
15. Swi-prolog. http://http://www.swi-prolog.org. Viewed December 2005.
16. The termination problems data base, http://www.lri.fr/~marche/tpdb/. Viewed December 2005.
17. G. Tseitin. On the complexity of derivation in propositional calculus. In Studies in Constructive Mathematics and Mathematical Logic, pages 115-125. 1968.
18. Reprinted in J. Siekmann and G. Wrightson (editors), Automation of Reasoning, vol. 2, pp. 466-483, Springer-Verlag Berlin, 1983.
19. Tyrolean termination tool, http://c12-informatik.uibk.ac.at/ttt. Viewed December 2005.
20. J. Wielemaker. An overview of the SWI-Prolog programming environment. In F. Mesnard and A. Serebenik, editors, Proceedings of the 13th International Workshop on Logic Programming Environments, pages 1-16, Heverlee, Belgium, Dec. 2003. Katholieke Universiteit Leuven. CW 371.
21. H. Zankl. Sat techniques for lexicographic path orders. http://arxiv.org/abs/cs.SC/0605021, May 2006.