CMODELS - SAT-based disjunctive answer set solver

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

Volumn 3662 LNAI, Issue , 2005, Pages 447-

  Lierler, Yuliya ^a  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33646043466     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11546207_44     Document Type: Conference Paper

References (14)

1. [Cla78] Keith Clark. Negation as failure. In Herve Gallaire and Jack Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, New York, 1978.
2. [FL05] Paolo Ferraris and Vladimir Lifschitz. Weight constraints as nested expressions. Theory and Practice of Logic Programming, 5:45-74, 2005.
3. [GL91] Michael Gelfond and Vladimir Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, 9:365-385, 1991.
4. [GLM04] Enrico Giunchiglia, Yuliya Lierler, and Marco Maratea. Sat-based answer set programming. In Proc. AAAI-04, pages 61-66, 2004.
5. [Jea05] T. Janhunen and et al. GnT(Generate'n'Test): A Solver for Disjunctive Logic Programs. 2005. Available under http://www.tes.hut.fi/Software/gnt/.
6. [JNSY00] T. Janhunen, I. Niemela, P. Simons, and J.H. You. Unfolding partiality and disjunctions in stable model semantics. In Proc. KR, 2000.
7. [KLP03] C. Koch, N. Leone, and G. Pfeifer. Enhancing disjunctive logic programming systems by sat checkers. Artificial Intelligence, 151:177-212, 2003.
8. [Lea05] N. Leone and et al. A disjunctive datalog system DLV(2005-02-23). 2005. Available under http://www.dbai.tuwien.ac.at/proj/dlv/.
9. [Lie05a] Y. Lierler. CMODELS - a tool for computing answer set using SAT solvers. 2005. Available under http://www.cs.utexas.edu/users/tag/cmodels.
10. [Lie05b] Yu. Lierler. Cmodels for tight disjunctive logic programs. In 19th Workshop on (Constraint) Logic Programming W(C)LP, 2005.
11. [LL03] Joohyung Lee and Vladimir Lifschitz. Loop formulas for disjunctive logic programs. In Proc. ICLP-03, pages 451-465, 2003.
12. [LZ02] Fangzhen Lin and Yuting Zhao. ASSAT: Computing answer sets of a logic program by SAT solvers. In Proc. AAAI-02, 2002.
13. [NS00] Ilkka Niemelä and Patrik Simons. Extending the Smodels system with cardinality and weight constraints. In Logic-Based Artificial Intelligence, pages 491-521. 2000.
14. [SS05] P. Simons and T. Syrjaenen. SMODELS and LPARSE - a solver and a grounder for normal logic programs. 2005. http://saturn.hut.fi/pub/smodels/.