SAT-based answer set programming

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 61-66

  Giunchiglia, Enrico ^a   Lierler, Yuliya ^b   Maratea, Marco ^a  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; TERMINOLOGY;

ANSWER SET PROGRAMMING (ASP); ARBITRARY PROGRAMS; LOGIC PROGRAMS; SET PROGRAMMING;

COMPUTER PROGRAMMING;

EID: 9444267655     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Babovich, Y.; Erdem, E.; and Lifschitz, V. 2000. Fages' theorem and answer set programming. In Proc. NMR.
2. Ben-Eliyahu, R., and Dechter, R. 1996. Prepositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence 12:53-87.
3. Clark, K. 1978. Negation as failure. In Gallaire, H., and Minker, J., eds., Logic and Data Bases. NY: Plenum Press. 293-322.
4. Ştefǎnescu, A.; Esparza, J.; and Muscholl, A. 2003. Synthesis of distributed algorithms using asynchronous automata. In Proc. of CONCUR, LNCS 2761.
5. Davis, M.; Logemann, G.; and Loveland, D. 1962. A machine program for theorem proving. JACM 5(7).
6. Eiter, T.; Leone, N.; Mateis, C.; Pfeifer, G.; and Scarcello, F. 1998. The KR system dlv: Progress report, comparisons and benchmarks. In Proc. KR.
7. Erdem, E., and Lifschitz, V. 2003. Tight logic programs. Theory and Practice of Logic Programming, 3:499-518.
8. Erdem, E. 2002. Theory and applications of answer set programming. Ph.D. Dissertation, UT at Austin.
9. Fages, F. 1994. Consistency of clark's completion and existence of stable models. Journal of Methods of Logic in Computer Science 1:51-60.
10. Ferraris, P., and Lifschitz, V. 2003. Weight constraints as nested expressions. Theory and Practice of Logic Programming. To appear.
11. Giunchiglia, E.; Maratea, M.; and Tacchella, A. 2003. (In)Effectiveness of look-ahead techniques in a modern SAT solver. In Proc. CP, LNCS 2833.
12. Heljanko, K., and Niemelä, I. 2003. Bounded LTL model checking with stable models. Theory and Practice of Logic Programming 3(4&5):519-550.
13. Lee, J., and Lifschitz, V. 2003. Loop formulas for disjunctive logic programs. In Proc. ICLP.
14. Lierler, Y., and Maratea, M. 2004. Cmodels-2: SAT-Based Answer Set Solver Enhanced to Non-tight Programs. In Proc. LPNMR, 346-350.
15. Lifschitz, V.; Tang, L. R.; and Turner, H. 1999. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence 25:369-389.
16. Lifschitz, V. 1996. Foundations of logic programming. In Brewka, G., ed., Principles of Knowledge Representation. CSLI Publications. 69-128.
17. Lin, F., and Zhao, Y. 2002. ASSAT: Computing answer sets of a logic program by SAT solvers. In Proc. AAAI.
18. Lloyd, J., and Topor, R. 1984. Making Prolog more expressive. Journal of Logic Programming 3:225-240.
19. Moskewicz, M. W.; Madigan, C. F.; Zhao, Y; Zhang, L.; and Malik, S. 2001. Chaff: Engineering an Efficient SAT Solver. In Proc. DAC.
20. Niemelä, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25:241-273.
21. Janhunen, T. 2003 A counter-based approach to translating normal logic programs into sets of clauses. Proc. ASP'03 Workshop, pp. 166-180.
22. Simons, P. 2000. Extending and implementing the stable model semantics. In Doctoral dissertation, 305-316.