Conflict-driven disjunctive answer set solving

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2008, Pages 422-432

  Drescher, Christian ^a   Gebser, Martin ^a   Grote, Torsten ^a   Kaufmann, Benjamin ^a   König, Arne ^a   Ostrowski, Max ^a   Schaub, Torsten ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; LOGIC PROGRAMMING;

ANSWER SET; ANSWER SET SOLVING; BLACK BOXES; BOOLEAN CONSTRAINT; CONSTRAINT-BASED; DISJUNCTIVE LOGIC PROGRAMS; P-COMPLETE PROBLEM; SOLVING ALGORITHM;

KNOWLEDGE REPRESENTATION;

EID: 58549088025     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (44)

1. Baral, C.; Brewka, G.; and Schlipf, J., eds. 2007. Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07). Springer-Verlag.
2. Baral, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
3. Beame, P., and Pitassi, T. 1998. Propositional proof complexity: Past, present, and future. Bulletin of the European Association for Theoretical Computer Science 65:66-89.
4. Ben-Eliyahu, R., and Dechter, R. 1994. Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence 12(1-2):53-87.
5. Calimeri, F.; Faber, W.; Pfeifer, G.; and Leone, N. 2006. Pruning operators for disjunctive logic programming systems. Fundamenta Informaticae 71(2-3):183-214.
6. claspD. http://www.cs.uni-potsdam.de/claspD.
7. Dechter, R. 2003. Constraint Processing. Morgan Kaufmann Publishers.
8. Eiter, T., and Gottlob, G. 1995. On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence 15(3- 4):289-323.
9. Eiter, T.; Fink, M.; Tompits, H.; and Woltran, S. 2004. Simplifying logic programs under uniform and strong equivalence. In Lifschitz and Niemel̈a (2004), 87-99.
10. Erdem, E., and Lifschitz, V. 2003. Tight logic programs. Theory and Practice of Logic Programming 3(4-5):499- 518.
11. Faber, W.; Leone, N.; Maratea, M.; and Ricca, F. 2007. Experimentingwith look-back heuristics for hard ASP programs. In Baral et al. (2007), 110-122.
12. Faber, W. 2002. Enhancing Efficiency and Expressiveness in Answer Set Programming Systems. Dissertation. Faber, W. 2008. Personal communication.
13. Gebser, M., and Schaub, T. 2006. Tableau calculi for answer set programming. In Etalle, S., and Truszczýnski, M., eds., Proceedings of the Twenty-second International Conference on Logic Programming (ICLP'06), 11-25. Springer-Verlag.
14. Gebser, M.; Kaufmann, B.; Neumann, A.; and Schaub, T. 2007a. Conflict-driven answer set enumeration. In Baral et al. (2007), 136-148.
15. Gebser, M.; Kaufmann, B.; Neumann, A.; and Schaub, T. 2007b. Conflict-driven answer set solving. In Veloso, M., ed., Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI'07), 386-392. AAAI Press/MIT Press.
16. Gebser, M.; Kaufmann, B.; Neumann, A.; and Schaub, T. 2008. Advanced preprocessing for answer set solving. In Proceedings of the Eighteenth European Conference on Artificial Intelligence (ECAI'08). IOS Press.
17. Gebser, M.; Lee, J.; and Lierler, Y. 2006. Elementary sets for logic programs. In Gil, Y., and Mooney, R., eds., Proceedings of the Twenty-first National Conference on Artificial Intelligence (AAAI'06). AAAI Press.
18. Gebser, M.; Schaub, T.; and Thiele, S. 2007. GrinGo: A new grounder for answer set programming. In Baral et al. (2007), 266-271.
19. Gelfond, M.; Lifschitz, V.; Przymusinska, H.; and Truszczýnski, M. 1991. Disjunctive defaults. In Allen, J.; Fikes, R.; and Sandewall, E., eds., Proceedings of the Second International Conference on Principles of Knowledge Representation and Reasoning (KR'91), 230-237. Morgan Kaufmann Publishers.
20. Janhunen, T.; Niemel̈a, I.; Seipel, D.; Simons, P.; and You, J. 2006. Unfolding partiality and disjunctions in stable model semantics. ACM Transactions on Computational Logic 7(1):1-37.
21. Koch, C.; Leone, N.; and Pfeifer, G. 2003. Enhancing disjunctive logic programming systems by SAT checkers. Artificial Intelligence 151(1-2):177-212.
22. Lee, J., and Lifschitz, V. 2003. Loop formulas for disjunctive logic programs. In Palamidessi, C., ed., Proceedings of the Nineteenth International Conference on Logic Programming (ICLP'03), 451-465. Springer-Verlag.
23. Lee, J. 2005. A model-theoretic counterpart of loop formulas. In Kaelbling, L., and Saffiotti, A., eds., Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI'05), 503-508. Professional Book Center.
24. Leone, N.; Pfeifer, G.; Faber, W.; Eiter, T.; Gottlob, G.; Perri, S.; and Scarcello, F. 2006. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7(3):499-562.
25. Leone, N.; Rullo, P.; and Scarcello, F. 1997. Disjunctive stablemodels: Unfounded sets, fixpoint semantics, and computation. Information and Computation 135(2):69- 112.
26. Lierler, Y. 2005. cmodels - SAT-based disjunctive answer set solver. In Baral, C.; Greco, G.; Leone, N.; and Terracina, G., eds., Proceedings of the Eighth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'05), 447-451. Springer-Verlag.
27. Lierler, Y. 2008. Personal communication.
28. Lifschitz, V., and Niemel̈a, I., eds. 2004. Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'04). Springer-Verlag.
29. Lifschitz, V., and Razborov, A. 2006. Why are there so many loop formulas? ACM Transactions on Computational Logic 7(2):261-268.
30. Marek, V., and Truszczýnski, M. 1999. Stable models and an alternative logic programming paradigm. In Apt, K.; Marek, W.; Truszczýnski, M.; and Warren, D., eds., The Logic Programming Paradigm: a 25-Year Perspective, 375-398. Springer-Verlag.
31. Marques-Silva, J., and Sakallah, K. 1999. GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers 48(5):506-521.
32. Mitchell, D. 2005. A SAT solver primer. Bulletin of the European Association for Theoretical Computer Science 85:112-133.
33. Niemel̈a, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25(3-4):241-273.
34. Papadimitriou, C. 1994. Computational Complexity. Addison-Wesley.
35. Pfeifer, G. 2004. Improving themodel generation/checking interplay to enhance the evaluation of disjunctive programs. In Lifschitz and Niemel̈a (2004), 220-233.
36. Ranjan, D.; Tang, D.; and Malik, S. 2004. A comparative study of 2QBF algorithms. In Electronic Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT'04).
37. Ricca, F.; Faber, W.; and Leone, N. 2006. A backjumping technique for disjunctive logic programming. AI Communications 19(2):155-172.
38. Schaefer, M., and Umans, C. 2002. Completeness in the polynomial-time hierarchy: A compendium. ACMSIGACT News 33(3):32-49.
39. Schlipf, J. 1995. The expressive powers of the logic programming semantics. Journal of Computer and Systems Sciences 51:64-86.
40. Simons, P.; Niemel̈a, I.; and Soininen, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2):181-234.
41. Syrj̈anen, T. Lparse 1.0 user's manual. Available at http://www.tcs.hut.fi/Software/smodels/lparse.ps.gz.
42. Van Gelder, A.; Ross, K.; and Schlipf, J. 1991. The wellfounded semantics for general logic programs. Journal of the ACM 38(3):620-650.
43. Ward, J., and Schlipf, J. 2004. Answer set programming with clause learning. In Lifschitz and Niemel̈a (2004), 302-313.
44. Zhang, L.; Madigan, C.; Moskewicz, M.; and Malik, S. 2001. Efficient conflict driven learning in a Boolean satisfiability solver. In Proceedings of the International Conference on Computer-Aided Design (ICCAD'01), 279-285.