Logic programming with satisfiability

Theory and Practice of Logic Programming

Volumn 8, Issue 1, 2008, Pages 121-128

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

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Boolean satisfiability; Propositional logic; SAT solvers

Indexed keywords

INTERFACES (COMPUTER); NUMERICAL METHODS; ONLINE SEARCHING; PROBLEM SOLVING;

BOOLEAN SATISFIABILITY; MINISAT SATISFIABILITY SOLVERS; PROLOG INTERFACES; PROPOSITIONAL LOGICS; SAT SOLVERS; SATISFIABILITY;

LOGIC PROGRAMMING;

EID: 36849050713     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068407003146     Document Type: Article

References (15)

1. ANNOV, E., CODISH, M., GIESL, J., SCHNEIDER-KAMP, P. AND THIEMANN, R. 2006. A sat-based implementation for RPO termination. URL: http://www.lix.polytechnique. fr/~hermann/LPAR2006/short.html. Short Paper at LPAR. Access date December 2006.
2. ARTS, T. AND GIESL, J. 2000. Termination of term rewriting using dependency pairs. Theoretical Computer Science 236 (1-2), 133-178.
3. CHA, B., IWAMA, K., KAMBAYASHI, Y. AND MIYAZAKI, S. 1997. Local search algorithms for partial MAXSAT. In AAAI/IAAI. 263-268.
4. CODISH, M., LAGOON, V. AND STUCKEY, P. J. 2006a. Minisat library for Prolog. URL:http://www.cs.bgu.ac.il/~mcodish/ Software/pl-minisat.tgz. Access date December 2006.
5. CODISH, M., LAGOON, V. AND STUCKEY, P. J. 2006b. Solving partial order constraints for LPO termination. In Term Rewriting and Applications (RTA). Lecture Notes in Computer Science, vol. 4098. Springer, Seattle, WA, 4-18.
6. CODISH, M., SCHNEIDER-KAMP, P., LAGOON, V., THIEMANN, R. AND GIESL, J. 2006c. Sat solving for argument filterings. In Logic for Programming, Artificial Intelligence and Reasoning (LPAR). Lecture Notes in Artificial Intelligence, vol. 4246. Springer, 30-44.
7. CORMEN, T. H., LEISERSON, C. E. AND RIVEST, R. L. 1990. Introduction to Algorithms. MIT Press, Chapter 29.
8. DERSHOWITZ, N. 1982. Orderings for term-rewriting systems. Theoretical Computer Science 17, 279-301.
9. EÉN, N. AND SÖRENSSON, N. 2004. An extensible SAT-solver. In Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003 (Selected Revised Papers), E. Giunchiglia and A. Tacchella, Eds. Lecture Notes in Computer Science, vol. 2919. Springer, 502-518.
10. MiniSat 2006, MiniSat solver. Accessed December 2005. URL: http://www.cs.chalmers.se/Cs/Research/FormalMethods/MiniSat.
11. MIYAZAKI, S., IWAMA, K. AND KAMBAYASHI1, Y. 1996. Database queries as combinatorial optimization problems. In CODAS. 477-483.
12. PLAISTED, D. AND GREENBAUM, S. 1986. A structure preserving clause form translation. Journal of Symbolic Computation 2, 293-304.
13. SWI-Prolog 2005. SWI-prolog. Accessed December 2005. URL: http://http://www.swi-prolog.org/.
14. TSEITIN, G. 1968. On the complexity of derivation in propositional calculus. In Studies in Constructive Mathematics and Mathematical Logic. 115-125. Reprinted in J. Siekmann and G. Wrightson (eds), 1983. Automation of Reasoning, vol. 2. Springer-Verlag, Berlin, 466-483.
15. WIELEMAKER, J. 2003. An overview of the SWI-Prolog programming environment. In Proceedings of the 13th International Workshop on Logic Programming Environments, F. Mesnard and A. Serebenik, Eds. Katholieke Universiteit Leuven, Heverlee, Belgium, 1-16. CW 371.