Proceedings

Advanced Conflict-Driven Disjunctive Answer Set Solving

Download BibTeX Cite

Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence. Pages 912-917.

© 2013 International Joint Conferences on Artificial Intelligence

Abstract

We introduce a new approach to disjunctive ASP solving that aims at an equitable interplay between generating and testing solver units. To this end, we develop novel characterizations of answer sets and unfounded sets allowing for a bidirectional dynamic information exchange between solver units for orthogonal tasks. This results in the new multi-threaded disjunctive ASP solver claspD-2, greatly improving the performance of existing systems.

  1. [Alviano et al., 2011] M. Alviano, F. Calimeri, W. Faber, N. Leone, and S. Perri. Unfounded sets and well-founded semantics of answer set programs with aggregates. Jour- nal of Artificial Intelligence Research, 42:487-527, 2011.
  2. [Baral, 2003] C. Baral. Knowledge Representation, Reason- ing and Declarative Problem Solving. Cambridge, 2003.
  3. [Ben-Eliyahu and Dechter, 1994] R. Ben-Eliyahu and R. Dechter. Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 12(1-2):53-87, 1994.
  4. [Calimeri et al., 2013] F. Calimeri, G. Ianni, and F. Ricca. The third open answer set programming competition. The- ory and Practice of Logic Programming, 2013. To appear.
  5. [Drescher et al., 2008] C. Drescher, M. Gebser, T. Grote, B. Kaufmann, A. König, M. Ostrowski, and T. Schaub. Conflict-driven disjunctive answer set solving. In Proc. In- ternational Conference on Principles of Knowledge Repre- sentation and Reasoning (KR'08), pages 422-432. AAAI Press, 2008.
  6. [Eén and Sörensson, 2003] N. Eén and N. Sörensson. Tem- poral induction by incremental SAT solving. Electronic Notes in Theoretical Computer Science, 89(4), 2003.
  7. [Eiter and Gottlob, 1995] T. Eiter and G. Gottlob. On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence, 15(3-4):289-323, 1995.
  8. [Gebser et al., 2008] M. Gebser, R. Kaminski, B. Kaufmann, M. Ostrowski, T. Schaub, and S. Thiele. Engineering an incremental ASP solver. In Proc. International Confer- ence on Logic Programming (ICLP'08), pages 190-205. Springer, 2008.
  9. [Gebser et al., 2010] M. Gebser, C. Guziolowski, M. Ivanchev, T. Schaub, A. Siegel, S. Thiele, and P. Veber. Repair and prediction (under inconsistency) in large biological networks with answer set program- ming. In Proc. International Conference on Principles of Knowledge Representation and Reasoning (KR'10), pages 497-507. AAAI Press, 2010.
  10. [Gebser et al., 2011a] M. Gebser, R. Kaminski, and T. Schaub. Complex optimization in answer set pro- gramming. Theory and Practice of Logic Programming, 11(4-5):821-839, 2011.
  11. [Gebser et al., 2011b] M. Gebser, T. Schaub, S. Thiele, and P. Veber. Detecting inconsistencies in large biological net- works with answer set programming. Theory and Practice of Logic Programming, 11(2-3):323-360, 2011.
  12. [Gebser et al., 2012a] M. Gebser, B. Kaufmann, and T. Schaub. Conflict-driven answer set solving: From theory to practice. AI Journal, 187-188:52-89, 2012.
  13. [Gebser et al., 2012b] M. Gebser, B. Kaufmann, and T. Schaub. Multi-threaded ASP solving with clasp. Theory and Practice of Logic Programming, 12(4-5):525- 545, 2012.
  14. [Janhunen et al., 2006] T. Janhunen, I. Niemelä, D. Seipel, P. Simons, and J. You. Unfolding partiality and disjunc- tions in stable model semantics. ACM Transactions on Computational Logic, 7(1):1-37, 2006.
  15. [Janota and Marques-Silva, 2011] M. Janota and J. Marques-Silva. On deciding MUS membership with QBF. In Proc. International Conference on Princi- ples and Practice of Constraint Programming (CP'11), pages 414-428. Springer, 2011.
  16. [Koch et al., 2003] C. Koch, N. Leone, and G. Pfeifer. En- hancing disjunctive logic programming systems by SAT checkers. AI Journal, 151(1-2):177-212, 2003.
  17. [Lee and Lifschitz, 2003] J. Lee and V. Lifschitz. Loop for- mulas for disjunctive logic programs. In Proc. Inter- national Conference on Logic Programming (ICLP'03), pages 451-465. Springer, 2003.
  18. [Leone et al., 1997] N. Leone, P. Rullo, and F. Scarcello. Disjunctive stable models: Unfounded sets, fixpoint se- mantics, and computation. Information and Computation, 135(2):69-112, 1997.
  19. [Leone et al., 2006] N. Leone, G. Pfeifer, W. Faber, T. Eiter, G. Gottlob, S. Perri, and F. Scarcello. The DLV system for knowledge representation and reasoning. ACM Transac- tions on Computational Logic, 7(3):499-562, 2006.
  20. [Lierler, 2005] Y. Lierler. Cmodels: SAT-based disjunctive answer set solver. In Proc. International Conference on Logic Programming and Nonmonotonic Reasoning (LP- NMR'05), pages 447-451. Springer, 2005.
  21. [Maratea et al., 2010] M. Maratea, F. Ricca, and P. Veltri. DLV MC : Enhanced model checking in DLV. In Proc. European Conference on Logics in Artificial Intelligence (JELIA'10), pages 365-368. Springer, 2010.
  22. [Marques-Silva and Sakallah, 1999] J. Marques-Silva and K. Sakallah. GRASP: A search algorithm for proposi- tional satisfiability. IEEE Transactions on Computers, 48(5):506-521, 1999.
  23. [Perri et al., 2010] S. Perri, F. Ricca, and M. Sirianni. A parallel ASP instantiator based on DLV. In Proc. Work- shop on Declarative Aspects of Multicore Programming (DAMP'10), pages 73-82. ACM Press, 2010.
  24. [Peschiera et al., 2010] C. Peschiera, L. Pulina, A. Tac- chella, U. Bubeck, O. Kullmann, and I. Lynce. The seventh QBF solvers evaluation (QBFEVAL'10). In Proc. Interna- tional Conference on Theory and Applications of Satisfia- bility Testing (SAT'10), pages 237-250. Springer, 2010.
  25. [Pfeifer, 2004] G. Pfeifer. Improving the model genera- tion/checking interplay to enhance the evaluation of dis- junctive programs. In Proc. International Conference on Logic Programming and Nonmonotonic Reasoning (LP- NMR'04), pages 220-233. Springer, 2004.
  26. Syrjänen, ] T. Syrjänen. Lparse 1.0 user's manual.
  27. [Tu et al., 2011] P. Tu, T. Son, M. Gelfond, and A. Morales. Approximation of action theories and its application to conformant planning. AI Journal, 175(1):79-119, 2011.
  28. [Zhang et al., 2001] L. Zhang, C. Madigan, M. Moskewicz, and S. Malik. Efficient conflict driven learning in a Boolean satisfiability solver. In Proc. International Con- ference on Computer-Aided Design (ICCAD'01), pages 279-285. ACM Press, 2001.

References were extracted automatically from the PDF and may contain errors.

Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards