Exploiting justifications for lazy grounding of answer set programs
Pages 1737 - 1745
Abstract
Answer set programming (ASP) is an established knowledge representation formalism. Lazy grounding avoids the so-called grounding bottleneck of ASP by interleaving grounding and solving; this technique was recently extended to work with conflict-driven clause learning. Unfortunately, it often happens that such a lazy grounding ASP system, at the fixpoint of the evaluation, arrives at an assignment that contains literals that are true but unjustified. The system then is unable to determine the actual causes of the situation and falls back to chronological backtracking, potentially wasting an exponential amount of time.
In this paper, we show how top-down query mechanisms can be used to analyze the situation, learn a new clause or nogood, and backjump further in the search tree. Contributions include a rephrasing of lazy grounding in terms of justifications and algorithms to construct relevant justifications without grounding. Initial experiments indicate that the newly developed techniques indeed allow for an exponential speed-up.
References
[1]
Krzysztof R. Apt. Principles of Constraint Programming. Cambridge University Press, 2003.
[2]
Marcello Balduccini, Yuliya Lierler, and Peter Schüller. Prolog and ASP inference under one roof. In Proceedings of LPNMR, pages 148-160, 2013.
[3]
Manuel Bichler, Michael Morak, and Stefan Woltran. lpopt: A rule optimization tool for answer set programming. In Proceedings of LOPSTR, Revised Selected Papers, pages 114-130, 2016.
[4]
Francesco Calimeri, Wolfgang Faber, Martin Gebser, Giovambattista Ianni, Roland Kaminski, Thomas Krennwallner, Nicola Leone, Francesco Ricca, and Torsten Schaub. ASP-Core-2 input language format. Technical report, ASP Standardization Working Group, 2013.
[5]
Francesco Calimeri, Giovambattista Ianni, and Francesco Ricca. The third open answer set programming competition. TPLP, 14(1):117-135, 2014.
[6]
Francesco Calimeri, Davide Fuscà, Simona Perri, and Jessica Zangari. I-DLV: the new intelligent grounder of DLV. Intelligenza Artificiale, 11(1):5-20, 2017.
[7]
Alessandro Dal Palù, Agostino Dovier, Enrico Pontelli, and Gianfranco Rossi. GASP: Answer set programming with lazy grounding. Fundam. Inform., 96(3):297-322, 2009.
[8]
Minh Dao-Tran, Thomas Eiter, Michael Fink, Gerald Weidinger, and Antonius Weinzierl. Omiga: An open minded grounding on-the-fly answer set solver. In Proceedings of JELIA, pages 480-483, 2012.
[9]
Broes De Cat, Marc Denecker, Maurice Bruynooghe, and Peter J. Stuckey. Lazy model expansion: Interleaving grounding with search. J. Artif. Intell. Res. (JAIR), 52:235-286, 2015.
[10]
Marc Denecker and Danny De Schreye. Justification semantics: A unifying framework for the semantics of logic programs. In Proceedings of LPNMR, pages 365-379, 1993.
[11]
Marc Denecker, Gerhard Brewka, and Hannes Strass. A formal theory of justifications. In Proceedings of LPNMR, pages 250-264, 2015.
[12]
Wolfgang Faber, Gerald Pfeifer, and Nicola Leone. Semantics and complexity of recursive aggregates in answer set programming. AIJ, 175(1):278-298, 2011.
[13]
Martin Gebser, Orkunt Sabuncu, and Torsten Schaub. An incremental answer set programming based system for finite model computation. AI Commun., 24(2):195-212, 2011.
[14]
Martin Gebser, Benjamin Kaufmann, and Torsten Schaub. Conflict-driven answer set solving: From theory to practice. AIJ, 187:52-89, 2012.
[15]
Martin Gebser, Anna Ryabokon, and Gottfried Schenner. Combining heuristics for configuration problems using answer set programming. In Proceedings of LPNMR, pages 384-397, 2015.
[16]
Martin Gebser, Marco Maratea, and Francesco Ricca. The sixth answer set programming competition. J. Artif. Intell. Res., 60:41-95, 2017.
[17]
Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Proceedings of ICLP/SLP, pages 1070-1080, 1988.
[18]
Joachim Jansen, Bart Bogaerts, Jo Devriendt, Gerda Janssens, and Marc Denecker. Relevance for SAT(ID). In Proceedings of IJCAI, pages 596-603, 2016.
[19]
Henryk Jan Komorowski. An introduction to partial deduction. In Proceedings of META, pages 49-69, 1992.
[20]
Claire Lefèvre and Pascal Nicolas. The first version of a new ASP solver: ASPeRiX. In Proceedings of LPNMR, pages 522-527, 2009.
[21]
Lorenz Leutgeb and Antonius Weinzierl. Techniques for efficient lazy-grounding ASP solving. In Proceedings of Declare 2017, pages 123-138, 2017.
[22]
Vladimir Lifschitz. Answer set planning. In Proceedings of ICLP, pages 23-37, 1999.
[23]
Victor Marek and Mirosław Truszczynski. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25-Year Perspective, pages 375-398. Springer-Verlag, 1999.
[24]
Kyle Marple and Gopal Gupta. Galliwasp: A goal-directed answer set solver. In Proceedings of LOPSTR, Revised Selected Papers, pages 122-136, 2012.
[25]
Kyle Marple, Elmer Salazar, and Gopal Gupta. Computing stable models of normal logic programs without grounding. CoRR, abs/1709.00501, 2017.
[26]
João P. Marques-Silva and Karem A. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers, 48(5):506-521, 1999.
[27]
João P. Marques Silva, Inês Lynce, and Sharad Malik. Conflict-driven clause learning SAT solvers. In Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh, editors, Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications, pages 131-153. 2009.
[28]
Ilkka Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell., 25(3-4):241-273, 1999.
[29]
Nico Passchyn. Justification frames. introducing splittable branch evaluations, 2017. Master Thesis; Denecker, Marc (supervisor).
[30]
Peter J. Stuckey. Lazy clause generation: Combining the power of SAT and CP (and mip?) solving. In Proceedings of CPAIOR, pages 5-9, 2010.
[31]
Richard Taupe, Antonius Weinzierl, and Gottfried Schenner. Introducing Heuristics for Lazy-Grounding ASP Solving. In Proceedings of PAoASP, 2017.
[32]
Antonius Weinzierl. Blending lazy-grounding and CDNL search for answer-set solving. In Proceedings of LPNMR, pages 191-204, 2017.
[33]
Lintao Zhang, Conor F. Madigan, Matthew W. Moskewicz, and Sharad Malik. Efficient conflict driven learning in Boolean satisfiability solver. In Proceedings of ICCAD, pages 279-285, 2001.
Index Terms
- Exploiting justifications for lazy grounding of answer set programs
Index terms have been assigned to the content through auto-classification.
Recommendations
Answer Set Programming with Constraints Using Lazy Grounding
ICLP '09: Proceedings of the 25th International Conference on Logic ProgrammingThe paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a preliminary grounding phase. The implementation of the framework can be ...
Enhancing lazy grounding with lazy normalization in answer-set programming
AAAI'19/IAAI'19/EAAI'19: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial IntelligenceAnswer-Set Programming (ASP) is an expressive rule-based knowledge-representation formalism. Lazy grounding is a solving technique that avoids the well-known grounding bottleneck of traditional ASP evaluation but is restricted to normal rules, severely ...
Automated Selection of Grounding Algorithm in Answer Set Programming
Proceeding of the XIIIth International Conference on AI*IA 2013: Advances in Artificial Intelligence - Volume 8249Answer Set Programming (ASP) is a powerful language for knowledge representation and reasoning. ASP is exploited in real-world applications and is also attracting the interest of industry thanks to the availability of efficient implementations. ASP ...
Comments
Information & Contributors
Information
Published In
Sponsors
- Adobe
- IBMR: IBM Research
- ERICSSON
- Microsoft: Microsoft
- AI Journal: AI Journal
Publisher
AAAI Press
Publication History
Published: 13 July 2018
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Sep 2024