Pooe

Answer Set Solving in Practice
Torsten Schaub1
University of Potsdam
[email protected]
Potassco Slide Packages are licensed under a Creative Commons Zero v1.0 Universal License.
1
Standing on the shoulders of a great research group and community!
Torsten Schaub (KRR@UP) Answer Set Solving in Practice October 22, 2022 1 / 535
Organization: Overview
1 Roadmap
2 Resources
3 Literature
4 Systems
Roadmap
Outline
1 Roadmap
2 Resources
3 Literature
4 Systems
Roadmap
What’s on the menu?

1 Motivation
2 Introduction
3 Modeling
4 Language
5 Grounding
6 Foundations
7 Solving
8 Multi-shot solving
9 Theory solving
10 Heuristic-driven solving
11 Systems
12 Advanced modeling
13 Preferences and Optimization
14 Applications
Bibliography
Resources
Outline
1 Roadmap
2 Resources
3 Literature
4 Systems
Resources
Resources
Course material
https://teaching.potassco.org
https://github.com/potassco-asp-course
Videos
https://youtube.com/c/potassco-live
Mailing lists
https://sourceforge.net/projects/potassco/lists/potassco-users
https://sourceforge.net/projects/potassco/lists/potassco-announce
Contact
[email protected]
Literature
Outline
1 Roadmap
2 Resources
3 Literature
4 Systems
Literature
The Potassco Book
1. Motivation
2. Introduction
3. Basic modeling Answer Set Solving in Practice
4. Grounding Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub
5. Characterizations
6. Solving
7. Systems SYNTHESIS LECTURES ON SAMPLE SERIES #1
M
8. Advanced modeling &C Morgan & cLaypool publishers
9. Conclusions
Resources
https://potassco.org/book
Literature
The Potassco Book
1. Motivation
2. Introduction
3. Basic modeling Answer Set Solving in Practice
4. Grounding Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub
5. Characterizations
6. Solving
7. Systems SYNTHESIS LECTURES ON SAMPLE SERIES #1
M
8. Advanced modeling &C Morgan & cLaypool publishers
9. Conclusions
Resources
Literature
The Potassco Book and Guide
Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub

Martin Gebser
Roland Kaminski
Benjamin Kaufmann
Marius Lindauer
Max Ostrowski
SYNTHESIS LECTURES ON SAMPLE SERIES #1
Javier Romero
Torsten Schaub
Sven Thiele
M
&C Morgan & cLaypool publishers
Resources
Literature
The ASP and Potassco Book, and Guide
Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub

Martin Gebser
Roland Kaminski
Benjamin Kaufmann
Marius Lindauer
Max Ostrowski
SYNTHESIS LECTURES ON SAMPLE SERIES #1
Javier Romero
Torsten Schaub
Sven Thiele
M
&C Morgan & cLaypool publishers
Resources
Literature
Literature
Books [5], [28], [35], [42], [47]

Surveys [44], [34], [20], [10], [39], [52]
Magazines [9], [53]
Articles [38], [37], [7], [49], [48], [43], [36], [26], etc.
Guide [32]
See also our bibliography on github
Literature
Literature
Books [5], [28], [35], [42], [47]

Surveys [44], [34], [20], [10], [39], [52]
Magazines [9], [53]
Articles [38], [37], [7], [49], [48], [43], [36], [26], etc.
Guide [32]
See also our bibliography on github
Systems
Outline
1 Roadmap
2 Resources
3 Literature
4 Systems
Systems
Systems
Systems
clingo [30] https://potassco.org
dlv [41, 2] https://www.dlvsystem.com
Grounders
lparse [55]
gringo [25, 31]+[27, 12] https://potassco.org
idlv [14]+[12] https://www.dlvsystem.com
Solvers
smodels [50, 54]
clasp [29, 24] https://potassco.org
wasp [4] https://www.mat.unical.it/ricca/wasp
Encodings
asparagus [8] https://asparagus.cs.uni-potsdam.de
competitions [33, 19, 16, 3, 15]
Auf Wiedersehen!
“Tomorrow isn’t staying out

I’ll be back, without a doubt!”
Pink panther
Bibliography
The following list of references is compiled from the

open source bibliography available at
https://github.com/krr-up/bibliography
Feel free to submit corrections via pull requests !
References
[1] S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases.

Addison-Wesley, 1995.
[2] M. Alviano et al. “The ASP System DLV2”. In: Proceedings of the
Fourteenth International Conference on Logic Programming and
Nonmonotonic Reasoning (LPNMR’17). Ed. by M. Balduccini and
T. Janhunen. Vol. 10377. Lecture Notes in Artificial Intelligence.
Springer-Verlag, 2017, pp. 215–221.
[3] M. Alviano et al. “The Fourth Answer Set Programming
Competition: Preliminary Report”. In: Proceedings of the Twelfth
International Conference on Logic Programming and Nonmonotonic
Reasoning (LPNMR’13). Ed. by P. Cabalar and T. Son. Vol. 8148.
Lecture Notes in Artificial Intelligence. Springer-Verlag, 2013,
pp. 42–53.
[4] M. Alviano et al. “WASP: A Native ASP Solver Based on Constraint
Learning”. In: Proceedings of the Twelfth International Conference
on Logic Programming and Nonmonotonic Reasoning (LPNMR’13).
References
Ed. by P. Cabalar and T. Son. Vol. 8148. Lecture Notes in Artificial

Intelligence. Springer-Verlag, 2013, pp. 54–66.
[5] C. Baral. Knowledge Representation, Reasoning and Declarative
Problem Solving. Cambridge University Press, 2003.
[6] C. Baral, G. Brewka, and J. Schlipf, eds. Proceedings of the Ninth
Reasoning (LPNMR’07). Vol. 4483. Lecture Notes in Artificial
Intelligence. Springer-Verlag, 2007.
[7] C. Baral and M. Gelfond. “Logic Programming and Knowledge
Representation”. In: Journal of Logic Programming 12 (1994),
pp. 1–80.
[8] P. Borchert et al. “Towards Systematic Benchmarking in Answer Set
Programming: The Dagstuhl Initiative”. In: Proceedings of the
Seventh International Conference on Logic Programming and
Nonmonotonic Reasoning (LPNMR’04). Ed. by V. Lifschitz and
I. Niemelä. Vol. 2923. Lecture Notes in Artificial Intelligence.
References
[9] G. Brewka, T. Eiter, and M. Truszczynski. “Answer Set

Programming: An Introduction to the Special Issue”. In: AI
Magazine 37.3 (2016), pp. 5–6.
[10] G. Brewka, T. Eiter, and M. Truszczyński. “Answer set
programming at a glance”. In: Communications of the ACM 54.12
(2011), pp. 92–103.
[11] P. Cabalar and T. Son, eds. Proceedings of the Twelfth International
Conference on Logic Programming and Nonmonotonic Reasoning
(LPNMR’13). Vol. 8148. Lecture Notes in Artificial Intelligence.
Springer-Verlag, 2013.
[12] F. Calimeri et al. “ASP-Core-2 Input Language Format”. In: Theory
and Practice of Logic Programming 20.2 (2019), pp. 294–309.
[13] F. Calimeri et al. “ASP-Core-2 Input Language Format”. In: Theory
[14] F. Calimeri et al. “I-DLV: The new intelligent grounder of DLV”. In:
Intelligenza Artificiale 11.1 (2017), pp. 5–20.
References
[15] F. Calimeri et al. “The Design of the Fifth Answer Set Programming
Competition”. In: Technical Communications of the Thirtieth
International Conference on Logic Programming (ICLP’14). Ed. by
M. Leuschel and T. Schrijvers. Vol. arXiv:1405.3710v4. Theory and
Practice of Logic Programming, Online Supplement. 2014. url:
http://arxiv.org/abs/1405.3710v4.
[16] F. Calimeri et al. “The Third Answer Set Programming
Competition: Preliminary Report of the System Competition Track”.
In: Proceedings of the Eleventh International Conference on Logic
Programming and Nonmonotonic Reasoning (LPNMR’11). Ed. by
J. Delgrande and W. Faber. Vol. 6645. Lecture Notes in Artificial
Intelligence. Springer-Verlag, 2011, pp. 388–403.
[17] M. D’Agostino et al., eds. Handbook of Tableau Methods. Kluwer
Academic Publishers, 1999.
[18] J. Delgrande and W. Faber, eds. Proceedings of the Eleventh
References

[19] M. Denecker et al. “The Second Answer Set Programming
Competition”. In: Proceedings of the Tenth International Conference
Ed. by E. Erdem, F. Lin, and T. Schaub. Vol. 5753. Lecture Notes in
Artificial Intelligence. Springer-Verlag, 2009, pp. 637–654.
[20] T. Eiter, G. Ianni, and T. Krennwallner. “Answer Set Programming:
A Primer”. In: Fifth International Reasoning Web Summer School
(RW’09). Ed. by S. Tessaris et al. Vol. 5689. Lecture Notes in
Computer Science. Slides at
http://www.kr.tuwien.ac.at/staff/tkren/pub/2009/rw2009-
lecture.zip. Springer-Verlag, 2009, pp. 40–110. url: http:
//www.kr.tuwien.ac.at/staff/tkren/pub/2009/rw2009-
asp.pdf.
[21] E. Erdem, F. Lin, and T. Schaub, eds. Proceedings of the Tenth
References

[22] M. Fitting. “A Kripke-Kleene Semantics for Logic Programs”. In:
Journal of Logic Programming 2.4 (1985), pp. 295–312.
[23] M. Fitting. “Fixpoint semantics for logic programming: A survey”.
In: Theoretical Computer Science 278.1-2 (2002), pp. 25–51.
[24] M. Gebser, B. Kaufmann, and T. Schaub. “Conflict-Driven Answer
Set Solving: From Theory to Practice”. In: Artificial Intelligence
187-188 (2012), pp. 52–89.
[25] M. Gebser, T. Schaub, and S. Thiele. “Gringo: A New Grounder for
Answer Set Programming”. In: Proceedings of the Ninth
Reasoning (LPNMR’07). Ed. by C. Baral, G. Brewka, and J. Schlipf.
Vol. 4483. Lecture Notes in Artificial Intelligence. Springer-Verlag,
2007, pp. 266–271.
[26] M. Gebser et al. “Abstract Gringo”. In: Theory and Practice of
Logic Programming 15.4-5 (2015), pp. 449–463.
References
[27] M. Gebser et al. “Advances in gringo Series 3”. In: Proceedings of

the Eleventh International Conference on Logic Programming and
Nonmonotonic Reasoning (LPNMR’11). Ed. by J. Delgrande and
W. Faber. Vol. 6645. Lecture Notes in Artificial Intelligence.
[28] M. Gebser et al. Answer Set Solving in Practice. Synthesis Lectures
on Artificial Intelligence and Machine Learning. Morgan and
Claypool Publishers, 2012.
[29] M. Gebser et al. “Conflict-Driven Answer Set Solving”. In:
Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence (IJCAI’07). Ed. by M. Veloso. AAAI/MIT
Press, 2007, pp. 386–392.
[30] M. Gebser et al. “Multi-shot ASP solving with clingo”. In: Theory
[31] M. Gebser et al. “On the Input Language of ASP Grounder Gringo”.
In: Proceedings of the Tenth International Conference on Logic
Programming and Nonmonotonic Reasoning (LPNMR’09). Ed. by
References
E. Erdem, F. Lin, and T. Schaub. Vol. 5753. Lecture Notes in

Artificial Intelligence. Springer-Verlag, 2009, pp. 502–508.
[32] M. Gebser et al. Potassco User Guide. 2nd ed. University of
Potsdam. 2015. url: http://potassco.org.
[33] M. Gebser et al. “The First Answer Set Programming System
Competition”. In: Proceedings of the Ninth International Conference
Ed. by C. Baral, G. Brewka, and J. Schlipf. Vol. 4483. Lecture Notes
in Artificial Intelligence. Springer-Verlag, 2007, pp. 3–17.
[34] M. Gelfond. “Answer Sets”. In: Handbook of Knowledge
Representation. Ed. by V. Lifschitz, F. van Harmelen, and B. Porter.
Elsevier Science, 2008. Chap. 7, pp. 285–316.
[35] M. Gelfond and Y. Kahl. Knowledge Representation, Reasoning, and
the Design of Intelligent Agents: The Answer-Set Programming
Approach. Cambridge University Press, 2014.
References
[36] M. Gelfond and N. Leone. “Logic programming and knowledge

representation — the A-Prolog perspective”. In: Artificial
Intelligence 138.1-2 (2002), pp. 3–38.
[37] M. Gelfond and V. Lifschitz. “Logic Programs with Classical
Negation”. In: Proceedings of the Seventh International Conference
on Logic Programming (ICLP’90). Ed. by D. Warren and P. Szeredi.
MIT Press, 1990, pp. 579–597.
[38] M. Gelfond and V. Lifschitz. “The Stable Model Semantics for Logic
Programming”. In: Proceedings of the Fifth International
Conference and Symposium of Logic Programming (ICLP’88).
Ed. by R. Kowalski and K. Bowen. MIT Press, 1988, pp. 1070–1080.
[39] R. Kaminski, T. Schaub, and P. Wanko. “A Tutorial on Hybrid
Answer Set Solving with clingo”. In: Proceedings of the Thirteenth
International Summer School of the Reasoning Web. Ed. by G. Ianni
et al. Vol. 10370. Lecture Notes in Computer Science.
References
[40] J. Lee. “A Model-Theoretic Counterpart of Loop Formulas”. In:

Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence (IJCAI’05). Ed. by L. Kaelbling and
A. Saffiotti. Professional Book Center, 2005, pp. 503–508.
[41] N. Leone et al. “The DLV System for Knowledge Representation and
Reasoning”. In: ACM Transactions on Computational Logic 7.3
(2006), pp. 499–562.
[42] V. Lifschitz. Answer Set Programming. Springer-Verlag, 2019.
[43] V. Lifschitz. “Answer set programming and plan generation”. In:
Artificial Intelligence 138.1-2 (2002), pp. 39–54.
[44] V. Lifschitz. “Introduction to answer set programming”.
Unpublished draft. 2004. url:
http://www.cs.utexas.edu/users/vl/papers/esslli.ps.
[45] V. Lifschitz. “Thirteen Definitions of a Stable Model”. In: Fields of
Logic and Computation, Essays Dedicated to Yuri Gurevich on the
Occasion of His 70th Birthday. Ed. by A. Blass, N. Dershowitz, and
References
W. Reisig. Vol. 6300. Lecture Notes in Computer Science.

[46] V. Lifschitz. “Twelve Definitions of a Stable Model”. In:
Proceedings of the Twenty-fourth International Conference on Logic
Programming (ICLP’08). Ed. by M. Garcia de la Banda and
E. Pontelli. Vol. 5366. Lecture Notes in Computer Science.
[47] V. Marek and M. Truszczyński. Nonmonotonic logic:
context-dependent reasoning. Artifical Intelligence. Springer-Verlag,
1993.
[48] V. Marek and M. Truszczyński. “Stable models and an alternative
logic programming paradigm”. In: The Logic Programming
Paradigm: a 25-Year Perspective. Ed. by K. Apt et al.
[49] I. Niemelä. “Logic Programs with Stable Model Semantics as a
Constraint Programming Paradigm”. In: Annals of Mathematics and
Artificial Intelligence 25.3-4 (1999), pp. 241–273.
References
[50] I. Niemelä and P. Simons. “Efficient Implementation of the

Well-founded and Stable Model Semantics”. In: Proceedings of the
Joint International Conference and Symposium on Logic
Programming. Ed. by M. Maher. MIT Press, 1996, pp. 289–303.
[51] D. Saccá and C. Zaniolo. “Stable Models and Non-Determinism in
Logic Programs with Negation”. In: Proceedings of the Ninth ACM
SIGACT-SIGMOD-SIGART Symposium on Principles of Database
Systems. ACM Press, 1990, pp. 205–217.
[52] T. Schaub and S. Woltran. “Answer set programming unleashed!”
In: Künstliche Intelligenz 32.2-3 (2018), pp. 105–108.
[53] T. Schaub and S. Woltran. “Special Issue on Answer Set
Programming”. In: Künstliche Intelligenz 32.2-3 (2018),
pp. 101–103.
[54] P. Simons, I. Niemelä, and T. Soininen. “Extending and
implementing the stable model semantics”. In: Artificial Intelligence
138.1-2 (2002), pp. 181–234.
[55] T. Syrjänen. “Omega-Restricted Logic Programs”. In: Proceedings
of the Sixth International Conference on Logic Programming and
Nonmonotonic Reasoning (LPNMR’01). Ed. by T. Eiter, W. Faber,
and M. Truszczyński. Vol. 2173. Lecture Notes in Computer Science.
[56] M. Truszczyński. “An introduction to the stable and well-founded
semantics of logic programs”. In: Declarative Logic Programming:
Theory, Systems, and Applications. Ed. by M. Kifer and Y. Liu.
ACM / Morgan & Claypool, 2018, pp. 121–177.
[57] A. Van Gelder, K. Ross, and J. Schlipf. “The Well-Founded
Semantics for General Logic Programs”. In: Journal of the ACM
38.3 (1991), pp. 620–650.

Pooe

Uploaded by

Copyright:

Available Formats

Pooe

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Pooe

Uploaded by

Copyright:

Available Formats

Answer Set Solving in Practice

What’s on the menu?

The Potassco Book

The Potassco Book

The Potassco Book and Guide

Answer Set Solving in Practice

Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub

The ASP and Potassco Book, and Guide

Answer Set Solving in Practice

Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub

Books [5], [28], [35], [42], [47]

See also our bibliography on github

Books [5], [28], [35], [42], [47]

See also our bibliography on github

“Tomorrow isn’t staying out

The following list of references is compiled from the

Feel free to submit corrections via pull requests !

[1] S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases.

Ed. by P. Cabalar and T. Son. Vol. 8148. Lecture Notes in Artificial

[9] G. Brewka, T. Eiter, and M. Truszczynski. “Answer Set

Reasoning (LPNMR’11). Vol. 6645. Lecture Notes in Artificial

Reasoning (LPNMR’09). Vol. 5753. Lecture Notes in Artificial

[27] M. Gebser et al. “Advances in gringo Series 3”. In: Proceedings of

E. Erdem, F. Lin, and T. Schaub. Vol. 5753. Lecture Notes in

[36] M. Gelfond and N. Leone. “Logic programming and knowledge

[40] J. Lee. “A Model-Theoretic Counterpart of Loop Formulas”. In:

W. Reisig. Vol. 6300. Lecture Notes in Computer Science.

[50] I. Niemelä and P. Simons. “Efficient Implementation of the

You might also like