Conflict-driven answer set solving

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 386-392

  Gebser, Martin ^a   Kaufmann, Benjamin ^a   Neumann, André ^a   Schaub, Torsten ^a,b,c  

^a UNIVERSITY OF POTSDAM   (Germany)

^b SIMON FRASER UNIVERSITY   (Canada)

^c GRIFFITH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET PROGRAMMING; ANSWER SET SOLVING; CONSTRAINT PROCESSING; CONSTRAINT-BASED; LOGIC PROGRAMS; NEW APPROACHES; SATISFIABILITY CHECKING; UNIT PROPAGATION;

ARTIFICIAL INTELLIGENCE; LOGIC PROGRAMMING;

CONSTRAINT SATISFACTION PROBLEMS;

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

References (24)

1. C. Anger, M. Gebser, and T. Schaub. Approaching the core of unfounded sets. In Proceedings of the 11th International Workshop on Nonmonotonic Reasoning, pages 58-66. Clausthal University of Technology, 2006.
2. K. Apt, H. Blair, and A. Walker. Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming, pages 89-148. Morgan Kaufmann Publishers, 1987.
3. C. Baral. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, 2003.
4. K. Clark. Negation as failure. In Logic and Data Bases, pages 293-322. Plenum Press, 1978.
5. http://www.cs.uni-potsdam.de/clasp.
6. R. Dechter. Constraint Processing. Morgan Kaufmann Publishers, 2003.
7. N. Eén and N. Sörensson. An extensible SAT-solver. In Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing, pages 502-518, 2003.
8. F. Fages. Consistency of Clark's completion and the existence of stable models. Journal of Methods of Logic in Computer Science, 1:51-60, 1994.
9. M. Gebser and T. Schaub. Tableau calculi for answer set programming. In Proceedings of the 22nd International Conference on Logic Programming, pages 11-25. Springer, 2006.
10. E. Giunchiglia, Y. Lierler, and M. Maratea. Answer set programming based on propositional satisfiability. Journal of Automated Reasoning, 2006. To appear.
11. E. Goldberg and Y. Novikov. BerkMin: A fast and robust SAT-solver. In Proceedings of the 5th Conference on Design, Automation and Test in Europe, pages 142-149, 2002.
12. J. Lee. A model-theoretic counterpart of loop formulas. In Proceedings of the 19th International Joint Conference on Artificial Intelligence, pages 503-508. Professional Book Center, 2005.
13. N. Leone, W. Faber, G. Pfeifer, T. Eiter, G. Gottlob, C. Koch, C. Mateis, S. Perri, and F. Scarcello. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic, 7(3):499-562, 2006. (Pubitemid 44330485)
14. V. Lifschitz and A. Razborov. Why are there so many loop formulas? ACM Transactions on Computational Logic, 7(2):261-268, 2006.
15. F. Lin and Y. Zhao. ASSAT: computing answer sets of a logic program by SAT solvers. Artificial Intelligence, 157(1-2):115-137, 2004.
16. Z. Lin, Y. Zhang, and H. Hernandez. Fast SAT-based answer set solver. In Proceedings of the 21st National Conference on Artificial Intelligence. AAAI Press/The MIT Press, 2006.
17. D. Mitchell. A SAT solver primer. Bulletin of the European Association for Theoretical Computer Science, 85:112-133, 2005.
18. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Conference on Design Automation, pages 530-535, 2001.
19. F. Ricca, W. Faber, and N. Leone. A backjumping technique for disjunctive logic programming. AI Communications, 19(2):155-172, 2006. (Pubitemid 43848926)
20. L. Ryan. Efficient algorithms for clause-learning SAT solvers. MSc, Sim. Fraser University, 2004.
21. P. Simons, I. Niemelä, and T. Soininen. Extending and implementing the stable model semantics. Artificial Intelligence, 138(1-2):181-234, 2002.
22. P. Simons. Extending and Implementing the Stable Model Semantics. Dissertation, Helsinki UT, 2000.
23. A. van Gelder, K. Ross, and J. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM, 38(3):620-650, 1991.
24. J. Ward and J. Schlipf. Answer set programming with clause learning. In Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 302-313. Springer, 2004.