Pedro Cabalar, Jorge Fandinno & Brais Muñiz (2020):
A System for Explainable Answer Set Programming.
Electronic Proceedings in Theoretical Computer Science 325,
pp. 124136,
doi:10.4204/eptcs.325.19.
M. Gelfond & V. Lifschitz (1988):
The stable model semantics for logic programming.
In: R. Kowalski & K. Bowen: Logic Programming: Proc. of the Fifth International Conf. and Symp.,
pp. 1070–1080.
Roland Kaminski, Torsten Schaub & Philipp Wanko (2017):
A tutorial on hybrid answer set solving with clingo.
In: Reasoning Web International Summer School.
Springer,
pp. 167–203.
V. Marek & M. Truszczyński (1999):
Stable models and an alternative logic programming paradigm.
In: The Logic Programming Paradigm: a 25-year Perspective,
pp. 375–398,
doi:10.1007/978-3-642-60085-2_17.
I. Niemelä (1999):
Logic programming with stable model semantics as a constraint programming paradigm.
Annals of Mathematics and Artificial Intelligence 25(3,4),
pp. 241–273,
doi:10.1023/A:1018930122475.
E. Pontelli, T.C. Son & O. El-Khatib (2009):
Justifications for logic programs under answer set semantics.
TPLP 9(1),
pp. 1–56.
Available at http://dx.doi.org/10.1017/S1471068408003633.
Claudia Schulz & Francesca Toni (2016):
Justifying answer sets using argumentation.
Theory and Practice of Logic Programming 16(1),
pp. 59–110,
doi:10.1017/S1471068414000702.
Patrik Simons, Ilkka Niemelä & Timo Soininen (2002):
Extending and implementing the stable model semantics.
Artificial Intelligence 138(1-2),
pp. 181–234,
doi:10.1016/S0004-3702(02)00187-X.
Ly Ly Trieu, Tran Cao Son, Enrico Pontelli & Marcello Balduccini (2021):
Generating explanations for answer set programming applications.
In: Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications III.
International Society for Optics and Photonics.
SPIE,
pp. 390 – 403.
Available at https://doi.org/10.1117/12.2587517.
eptcs@eptcs.org