Fast SAT-based answer set solver

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2006, Pages 92-97

  Lin, Zhijun ^a   Zhang, Yuanlin ^a   Hemandez, Hector ^a  

^a Department of Electrical and Computer Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; ITERATIVE METHODS; PROBLEM SOLVING; SET THEORY;

MODEL GENERATION; PARTIAL ASSIGNMENTS; SET SOLVER;

LOGIC PROGRAMMING;

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

References (14)

1. Clark, K. L. 1978. Negation as failure. In Gallaire, H., and Minker, J., eds., Logic and Data Bases. Plenum Press, NY. 293-322.
2. Davis, M.; Logemann, G.; and Loveland, D. 1962. A machine program for theorem proving. Communications of the ACM (5):394-397.
3. Fages, F. 1994. Consistency of Clark's completion and existence of stable models. Journal of Methods of Logic in Computer Science 1:51-60.
4. Ferraris, P., and Lifschitz, V. 2003. Weight constraints as nested expressions. CoRR cs.AI/0312045.
5. Gelfond, M., and Lifschitz, V. 1988. The stable model semantics for logic programming. In Kowalski, R. A., and Bowen, K., eds., Proceedings of the Fifth International Conference on Logic Programming, 1070-1080. Cambridge, Massachusetts: The MIT Press.
6. Heljanko, K., and Niemelä, I. 2003. Bounded LTL model checking with stable models. Theory and Practice of Logic Programming 3(4&5):519-550.
7. Lee, J., and Lifschitz, V. 2003. Loop formulas for disjunctive logic programs. In Palamidessi, C., ed., ICLP, volume 2916 of Lecture Notes in Computer Science, 451-465. Springer.
8. Lierler, Y., and Maratea, M. 2004. Cmodels-2: SAT-based answer set solver enhanced to non-tight programs. In Lifschitz, V., and Niemelä, I., eds., LPNMR, volume 2923 of Lecture Notes in Computer Science, 346-350. Springer.
9. Lin, F., and Zhao, Y. 2002. ASSAT: Computing answer sets of a logic program by SAT solvers. In AAAI/IAAI, 112-118.
10. Moskewicz, M. W.; Madigan, C. F.; Zhao, Y.; Zhang, L.; and Malik, S. 2001. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference (DAC'01).
11. Niemelä, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intellignece 25:241 - 273.
12. Simons, P.; Niemelä, I.; and Soininen, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2): 181-234.
13. Stefanescu, A.; Esparza, J.; and Muscholl, A. 2003. Synthesis of distributed algorithms using asynchronous automata. In CONCUR, 27-41.
14. Zhang, L.; Madigan, C. F.; Moskewicz, M. W.; and Malik, S. 2001. Efficient conflict driven learning in boolean satisfiability solver. In ICCAD, 279-285.