References

1. Pedro Cabalar, Jorge Fandinno & Yuliya Lierler (2020): Modular Answer Set Programming as a Formal Specification Language. Theory and Practice of Logic Programming, doi:10.1007/978-1-4471-0043-0.
2. Keith L. Clark (1978): Negation as Failure, pp. 293–322. Springer US, Boston, MA, doi:10.1007/978-1-4684-3384-5_11.
3. Jorge Fandinno, Zach Hansen & Yuliya Lierler (2022): Axiomatization of Aggregates in Answer Set Programming. In: Proceedings of the Thirty-six National Conference on Artificial Intelligence (AAAI'22). AAAI Press.
4. Jorge Fandinno, Vladimir Lifschitz, Patrick Lühne & Torsten Schaub (2020): Verifying Tight Logic Programs with anthem and vampire. Theory and Practice of Logic Programming 5(20), pp. 735–750, doi:10.1017/S1471068403001765.
5. Paolo Ferraris, Joohyung Lee & Vladimir Lifschitz (2011): Stable models and circumscription. Artificial Intelligence 175(1), pp. 236–263, doi:10.1016/j.artint.2010.04.011.
6. Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Marius Lindauer, Max Ostrowski, Javier Romero, Torsten Schaub, Sven Thiele & Philipp Wanko (2019): Potassco User Guide, 2.2.0 edition. University of Potsdam.
7. Michael Gelfond & Vladimir Lifschitz (1988): The Stable Model Semantics for Logic Programming. In: Robert Kowalski, Bowen & Kenneth: Proceedings of International Logic Programming Conference and Symposium. MIT Press, pp. 1070–1080. Available at http://www.cs.utexas.edu/users/ai-lab?gel88.
8. Amelia Harrison, Vladimir Lifschitz & Dhananjay Raju (2017): Program completion in the input language of GRINGO. Theory and Practice of Logic Programming 17(5-6), pp. 855–871, doi:10.1007/978-1-4684-3384-5_11.
9. Amelia Harrison, Vladimir Lifschitz & Fangkai Yang (2014): The Semantics of Gringo and Infinitary Propositional Formulas. In: Proceedings of the Fourteenth International Conference on Principles of Knowledge Representation and Reasoning, KR'14. AAAI Press, pp. 32–41, doi:10.1007/978-1-4684-3384-5_11.
10. Charles Anthony Richard Hoare (1969): An Axiomatic Basis for Computer Programming. Commun. ACM 12(10), pp. 576–580, doi:10.1145/363235.363259.
11. Tomi Janhunen & Ilkka Nimelä (2016): The Answer Set Programming Paradigm. AI Magazine 37(3), pp. 13–24, doi:10.1609/aimag.v37i3.2671. Available at https://aaai.org/ojs/index.php/aimagazine/article/view/2671.
12. Laura Kovács & Andrei Voronkov (2013): First-Order Theorem Proving and Vampire. In: Natasha Sharygina & Helmut Veith: Computer Aided Verification - 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings, Lecture Notes in Computer Science 8044. Springer, pp. 1–35, doi:10.1007/978-3-642-39799-8_1.
13. Vladimir Lifschitz, Patrick Lühne & Torsten Schaub (2020): Towards Verifying Logic Programs in the Input Language of clingo. In: Andreas Blass, Patrick Cégielski, Nachum Dershowitz, Manfred Droste & Bernd Finkbeiner: Fields of Logic and Computation III. Springer International Publishing, Cham, pp. 190–209, doi:10.1007/978-1-4684-3384-5_11.
14. Victor W. Marek & Miroslaw Truszczyński (1999): Stable Models and an Alternative Logic Programming Paradigm, pp. 375–398. Springer Berlin Heidelberg, Berlin, Heidelberg, doi:10.1007/978-3-642-60085-2_17.
15. Ilkka Niemelä (1999): Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25(3), pp. 241–273, doi:10.1023/A:1018930122475.
16. Geoff Sutcliffe (2017): The TPTP Problem Library and Associated Infrastructure. From CNF to TH0, TPTP v6.4.0. Journal of Automated Reasoning 59(4), pp. 483–502, doi:10.1007/s10817-017-9407-7.
17. Miroslaw Truszczynski: Connecting First-Order ASP and the Logic FO(ID) through Reducts. Lecture Notes in Computer Science 7265. Springer Berlin Heidelberg, doi:10.1007/978-3-642-30743-0_37. Available at http://link.springer.com/10.1007/978-3-642-30743-0_37.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org