Document Open Access Logo

Speeding up Lazy-Grounding Answer Set Solving

Author Richard Taupe

PDF
Thumbnail PDF

File

OASIcs.ICLP.2018.20.pdf
  • Filesize: 378 kB
  • 9 pages

Document Identifiers

Author Details

Richard Taupe
  • Alpen-Adria-Universität, Klagenfurt, Austria, Siemens AG Österreich, Vienna, Austria

Funding

This work was partially conducted within the scope of DynaCon (FFG-PNr.: 861263), which is funded by the Austrian Federal Ministry of Transport, Innovation and Technology (BMVIT) under the program "ICT of the Future" between November 2017 and April 2020. More information: https://iktderzukunft.at/en/

Cite As Get BibTex

Richard Taupe. Speeding up Lazy-Grounding Answer Set Solving. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 20:1-20:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018) https://doi.org/10.4230/OASIcs.ICLP.2018.20

Abstract

The grounding bottleneck is an important open issue in Answer Set Programming. Lazy grounding addresses it by interleaving grounding and search. The performance of current lazy-grounding solvers is not yet comparable to that of ground-and-solve systems, however. The aim of this thesis is to extend prior work on lazy grounding by novel heuristics and other techniques like non-ground conflict learning in order to speed up solving. Parts of expected results will be beneficial for ground-and-solve systems as well.

Subject Classification

ACM Subject Classification
  • Computing methodologies → Logic programming and answer set programming
Keywords
  • answer set programming
  • lazy grounding
  • heuristics

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Mario Alviano, Carmine Dodaro, Wolfgang Faber, Nicola Leone, and Francesco Ricca. WASP: A native ASP solver based on constraint learning. In Pedro Cabalar and Tran Cao Son, editors, Logic Programming and Nonmonotonic Reasoning, 12th International Conference, LPNMR 2013, Corunna, Spain, September 15-19, 2013. Proceedings, volume 8148 of Lecture Notes in Computer Science, pages 54-66. Springer, 2013. URL: http://dx.doi.org/10.1007/978-3-642-40564-8_6.
  2. ASP Standardization Working Group. ASP-Core-2 input language format, 2012-12-13. URL: https://www.mat.unical.it/aspcomp2013/files/ASP-CORE-2.03b.pdf.
  3. Gerhard Brewka, Thomas Eiter, and Miroslaw Truszczynski. Answer set programming at a glance. Commun. ACM, 54(12):92-103, 2011. URL: http://dx.doi.org/10.1145/2043174.2043195.
  4. Francesco Calimeri, Davide Fuscà, Simona Perri, and Jessica Zangari. ℐ-dlv: The New Intelligent Grounder of dlv. In Giovanni Adorni, Stefano Cagnoni, Marco Gori, and Marco Maratea, editors, AI*IA 2016: Advances in Artificial Intelligence - XVth International Conference of the Italian Association for Artificial Intelligence, Genova, Italy, November 29 - December 1, 2016, Proceedings, volume 10037 of Lecture Notes in Computer Science, pages 192-207. Springer, 2016. URL: http://dx.doi.org/10.1007/978-3-319-49130-1_15.
  5. Francesco Calimeri, Martin Gebser, Marco Maratea, and Francesco Ricca. Design and results of the Fifth Answer Set Programming Competition. Artif. Intell., 231:151-181, 2016. URL: http://dx.doi.org/10.1016/j.artint.2015.09.008.
  6. Bernardo Cuteri, Carmine Dodaro, Francesco Ricca, and Peter Schüller. Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis. TPLP, 17(5-6):780-799, 2017. URL: http://dx.doi.org/10.1017/S1471068417000254.
  7. Minh Dao-Tran, Thomas Eiter, Michael Fink, Gerald Weidinger, and Antonius Weinzierl. OMiGA : An open minded grounding on-the-fly answer set solver. In Luis Fariñas del Cerro, Andreas Herzig, and Jérôme Mengin, editors, Logics in Artificial Intelligence - 13th European Conference, JELIA 2012, Toulouse, France, September 26-28, 2012. Proceedings, volume 7519 of Lecture Notes in Computer Science, pages 480-483. Springer, 2012. URL: http://dx.doi.org/10.1007/978-3-642-33353-8_38.
  8. Broes de Cat, Marc Denecker, Peter J. Stuckey, and Maurice Bruynooghe. Lazy Model Expansion: Interleaving Grounding with Search. J. Artif. Intell. Res., 52:235-286, 2015. URL: http://dx.doi.org/10.1613/jair.4591.
  9. Carmine Dodaro, Philip Gasteiger, Nicola Leone, Benjamin Musitsch, Francesco Ricca, and Konstantin Schekotihin. Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper). TPLP, 16(5-6):653-669, 2016. URL: http://dx.doi.org/10.1017/S1471068416000284.
  10. Thomas Eiter, Wolfgang Faber, Michael Fink, and Stefan Woltran. Complexity results for answer set programming with bounded predicate arities and implications. Ann. Math. Artif. Intell., 51(2-4):123-165, 2007. URL: http://dx.doi.org/10.1007/s10472-008-9086-5.
  11. Thomas Eiter, Gerhard Friedrich, Richard Taupe, and Antonius Weinzierl. Lazy Grounding for Dynamic Configuration. KI - Künstliche Intelligenz, May 2018. URL: http://dx.doi.org/10.1007/s13218-018-0536-x.
  12. Wolfgang Faber, Nicola Leone, and Simona Perri. The Intelligent Grounder of DLV. In Esra Erdem, Joohyung Lee, Yuliya Lierler, and David Pearce, editors, Correct Reasoning - Essays on Logic-Based AI in Honour of Vladimir Lifschitz, volume 7265 of Lecture Notes in Computer Science, pages 247-264. Springer, 2012. URL: http://dx.doi.org/10.1007/978-3-642-30743-0_17.
  13. Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub, and Philipp Wanko. Theory Solving Made Easy with Clingo 5. In Manuel Carro, Andy King, Neda Saeedloei, and Marina De Vos, editors, Technical Communications of the 32nd International Conference on Logic Programming, ICLP 2016 TCs, October 16-21, 2016, New York City, USA, volume 52 of OASICS, pages 2:1-2:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. URL: http://dx.doi.org/10.4230/OASIcs.ICLP.2016.2.
  14. Martin Gebser, Roland Kaminski, Arne König, and Torsten Schaub. Advances in gringo Series 3. In James P. Delgrande and Wolfgang Faber, editors, Logic Programming and Nonmonotonic Reasoning - 11th International Conference, LPNMR 2011, Vancouver, Canada, May 16-19, 2011. Proceedings, volume 6645 of Lecture Notes in Computer Science, pages 345-351. Springer, 2011. URL: http://dx.doi.org/10.1007/978-3-642-20895-9_39.
  15. Martin Gebser, Benjamin Kaufmann, Ramón Otero, Javier Romero, Torsten Schaub, and Philipp Wanko. Domain-Specific Heuristics in Answer Set Programming. In Marie desJardins and Michael L. Littman, editors, Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, July 14-18, 2013, Bellevue, Washington, USA., pages 350-356. AAAI Press, 2013. URL: http://www.aaai.org/ocs/index.php/AAAI/AAAI13/paper/view/6278.
  16. Martin Gebser, Benjamin Kaufmann, and Torsten Schaub. Conflict-driven answer set solving: From theory to practice. Artif. Intell., 187:52-89, 2012. URL: http://dx.doi.org/10.1016/j.artint.2012.04.001.
  17. Michael Gelfond and Vladimir Lifschitz. The Stable Model Semantics for Logic Programming. In Robert A. Kowalski and Kenneth A. Bowen, editors, Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, August 15-19, 1988 (2 Volumes), pages 1070-1080. MIT Press, 1988. Google Scholar
  18. Evguenii I. Goldberg and Yakov Novikov. BerkMin: A Fast and Robust Sat-Solver. In 2002 Design, Automation and Test in Europe Conference and Exposition (DATE 2002), 4-8 March 2002, Paris, France, pages 142-149. IEEE Computer Society, 2002. URL: http://dx.doi.org/10.1109/DATE.2002.998262.
  19. Benjamin Kaufmann, Nicola Leone, Simona Perri, and Torsten Schaub. Grounding and Solving in Answer Set Programming. AI Magazine, 37(3):25-32, 2016. URL: http://www.aaai.org/ojs/index.php/aimagazine/article/view/2672.
  20. Claire Lefèvre, Christopher Béatrix, Igor Stéphan, and Laurent Garcia. ASPeRiX, a first-order forward chaining approach for answer set computing. TPLP, 17(3):266-310, 2017. URL: http://dx.doi.org/10.1017/S1471068416000569.
  21. Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg Gottlob, Simona Perri, and Francesco Scarcello. The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Log., 7(3):499-562, 2006. URL: http://dx.doi.org/10.1145/1149114.1149117.
  22. Vladimir Lifschitz. What Is Answer Set Programming? In Dieter Fox and Carla P. Gomes, editors, Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, Chicago, Illinois, USA, July 13-17, 2008, pages 1594-1597. AAAI Press, 2008. URL: http://www.aaai.org/Library/AAAI/2008/aaai08-270.php.
  23. Vladimir Lifschitz. Thirteen Definitions of a Stable Model. In Andreas Blass, Nachum Dershowitz, and Wolfgang Reisig, editors, Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday, volume 6300 of Lecture Notes in Computer Science, pages 488-503. Springer, 2010. URL: http://dx.doi.org/10.1007/978-3-642-15025-8_24.
  24. Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference, DAC 2001, Las Vegas, NV, USA, June 18-22, 2001, pages 530-535. ACM, 2001. URL: http://dx.doi.org/10.1145/378239.379017.
  25. Alessandro Dal Palù, Agostino Dovier, Enrico Pontelli, and Gianfranco Rossi. GASP: answer set programming with lazy grounding. Fundam. Inform., 96(3):297-322, 2009. URL: http://dx.doi.org/10.3233/FI-2009-180.
  26. Gottfried Schenner and Richard Taupe. Techniques for Solving Large-Scale Product Configuration Problems with ASP. In Linda L. Zhang and Albert Haag, editors, Proceedings of the 19th International Configuration Workshop, pages 12-19, La Défense, France, 2017. URL: https://www.ieseg.fr/wp-content/uploads/2017/01/Proceedgins_FinalV2.pdf#page=12.
  27. Richard Taupe. Lazy Grounding and Heuristic Solving in Answer Set Programming. In Marina de Vos, editor, LPNMR 2017 Doctoral Consortium, Bath, 2017. URL: http://lpnmr-dc.cs.bath.ac.uk/programme/Proceedings.pdf#page=41.
  28. Richard Taupe, Antonius Weinzierl, and Gottfried Schenner. Introducing Heuristics for Lazy-Grounding ASP Solving. In 1st International Workshop on Practical Aspects of Answer Set Programming, 2017. URL: https://sites.google.com/site/paoasp2017/Taupe-et-al.pdf.
  29. Antonius Weinzierl. Learning Non-Ground Rules for Answer-Set Solving. In David Pearce, Shahab Tasharrofi, Evgenia Ternovska, and Concepción Vidal, editors, 2nd Workshop on Grounding and Transformations for Theories With Variables, pages 25-37, 2013. URL: http://kr.irlab.org/sites/10.56.35.200.gttv13/files/gttv13.pdf#page=31.
  30. Antonius Weinzierl. Blending Lazy-Grounding and CDNL Search for Answer-Set Solving. In Marcello Balduccini and Tomi Janhunen, editors, Logic Programming and Nonmonotonic Reasoning - 14th International Conference, LPNMR 2017, Espoo, Finland, July 3-6, 2017, Proceedings, volume 10377 of Lecture Notes in Computer Science, pages 191-204. Springer, 2017. URL: http://dx.doi.org/10.1007/978-3-319-61660-5_17.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact