Cmodels-2: SAT-based answer set solver enhanced to non-tight programs

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2923, Issue , 2004, Pages 346-350

  Lierler, Yuliya ^a   Maratea, Marco ^b  

^a University of Texas at Austin   (United States)

^b UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SYSTEM RECOVERY; GRAPH THEORY; HAMILTONIANS; MATHEMATICAL MODELS; PROGRAM ASSEMBLERS; SEMANTICS; SET THEORY;

CORDINALITY EXPRESSIONS; HAMILTONIAN CIRCUITS (HC); LOGIC PROGRAMS; NON-TIGHT PROGRAMS;

COMPUTER PROGRAMMING;

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

References (13)

1. V. Marek and M. Truszczyński. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: a 25-Year Perspective. Springer Verlag, 1999.
2. I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25:241-273, 1999.
3. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Robert Kowalski and Kenneth Bowen, editors, Logic Programming: Proc. Fifth Int'l Conf. and Symp., pages 1070-1080, 1988.
4. K. Clark. Negation as failure. In Herve Gallaire and Jack Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, New York, 1978.
5. Yu. Babovich, E. Erdem, and V. Lifschitz. Fages' theorem and answer set programming. In Proc. Eighth Int'l Workshop on Non-Monotonic Reasoning, 2000.
6. F. Fages. Consistency of Clark's completion and existence of stable models. Journal of Methods of Logic in Computer Science, 1:51-60, 1994.
7. F. Lin and Y. Zhao. ASSAT: Computing answer sets of a logic program by SAT solvers. In Proc. AAAI-02, 2002.
8. J. Lee and V. Lifschitz. Loop formulas for disjunctive logic programs. In Proc. ICLP-03, To appear.
9. T. Syrjanen. Lparse manual. 2003.
10. V. Lifschitz, L. R. Tang, and H. Turner. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25:369-389, 1999.
11. P. Ferraris and V. Lifschitz. Weight constraints as nested expressions. Theory and Practice of Logic Programming, to appear.
12. Yu. Lierler and V. Lifschitz. Computing answer sets using program completion Unpublished draft.
13. A. Armando, C. Castellini, E. Giunchiglia, F. Giunchiglia and A. Tacchella. SAT-Based Decision Procedures for Automated Reasoning: a Unifying Perspective. In Festschrift in Honor of Jörg H. Siekmann, to appear in LNAI, Springer-Verlag 2002.