Disjunctive answer set programming via satisfiability

CEUR Workshop Proceedings

Volumn 142, Issue , 2005, Pages 85-97

  Lierler, Yuliya ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET; ANSWER SET PROGRAMMING; DISJUNCTIVE LOGIC PROGRAMS; EFFICIENT SYSTEMS; IN-BUILDINGS; LOOP FORMULAS; SAT SOLVERS; SATISFIABILITY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DECISION THEORY; FORMAL LOGIC;

LOGIC PROGRAMMING;

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

References (20)

1. D. R. Brooks, E. Erdem, J. W. Minett, and D. Ringe. Character-based cladistics and answer set programming. In Proc. PADL'05, pages 37-51, 2005.
2. Keith Clark. Negation as failure. In Herve Gallaire and Jack Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, New York, 1978.
3. Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem proving. Communications of the ACM, 5(7):394-397, 1962.
4. Esra Erdem and Vladimir Lifschitz. Tight logic programs. Theory and Practice of Logic Programming, 3:499-518, 2003.
5. E. Erdem and M.D.F. Wong. Rectilinear steiner tree construction using answer set programming. In Proc. ICLP'04, pages 386-399, 2004.
6. Paolo Ferraris and Vladimir Lifschitz. Weight constraints as nested expressions. Theory and Practice of Logic Programming, 5:45-74, 2005.
7. Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
8. Enrico Giunchiglia, Yuliya Lierler, and Marco Maratea. Sat-based answer set programming. In Proc. AAAI-04, pages 61-66, 2004.
9. T. Janhunen and et al. GnT (Generate'n'Test): A Solver for Disjunctive Logic Programs. 2005. Available under http://www.tcs.hut.fi/Software/gnt/.
10. T. Janhunen, I. Niemela, P. Simons, and J.H. You. Unfolding partiality and disjunctions in stable model semantics. In Proc. KR, 2000.
11. C. Koch, N. Leone, and G. Pfeifer. Enhancing disjunctive logic programming systems by sat checkers. Artificial Intelligence, 151:177-212, 2003.
12. Yu. Lierler and etc. CMODELS - a tool for computing answer set using SAT solvers. 2005. Available http://www.cs.utexas.edu/users/tag/cmodels.
13. Yu. Lierler. Cmodels for tight disjunctive logic programs. In 19th Workshop on (Constraint) Logic Programming W(C)LP, number 2005-01 in Ulmer Informatik-Berichte, 2005. http://www.informatik.uni-ulm.de/epin/pw/11541.
14. Joohyung Lee and Vladimir Lifschitz. Loop formulas for disjunctive logic programs. In Proc. ICLP-03, pages 451-465, 2003.
15. Yuliya Lierler and Marco Maratea. Cmodels-2: Sat-based answer set solver enhanced to non-tight programs. In Proc. LPNMR-04, pages 346-350, 2004.
16. N. Leone, G. Pfeifer, T. Eiter, G. Gottlob, S. Perri, and F. Scarcello. The dlv system for knowledge representation and reasoning. ACM TOCL, 2005. To appear. System available under http://www.dbai.tuwien.ac.at/proj/dlv/.
17. Fangzhen Lin and Yuting Zhao. ASSAT: Computing answer sets of a logic program by SAT solvers. In Proc. AAAI-02, pages 112-117, 2002. System ASSAT availabe at http://assat.cs.ust.hk/.
18. Ilkka Niemelä and Patrik Simons. Extending the Smodels system with cardinality and weight constraints. In Jack Minker, editor, Logic-Based Artificial Intelligence, pages 491-521. Kluwer, 2000.
19. P. Simons and T. Syrjaenen. SMODELS and LPARSE - a solver and a grounder for normal logic programs. 2005. Available at World Wide Web http://saturn.hut.fi/pub/smodels/.
20. J. Ward and J. Schlipf. Answer set programming with clause learning. In Logic Programming and Nonmonotonic Reasoning, 7th International Conference, 2004.