Abstract
In this paper, we present a system, called xASP, for generating explanations that explain why an atom belongs to (or does not belong to) an answer set of a given program. The system can generate all possible explanations for a query without the need to simplify the program before computing explanations, i.e., it works with non-ground programs. These properties distinguish xASP from existing systems such as \(\texttt{xClingo}\), \(\texttt{DiscASP}\), \(\textit{exp}(\textit{ASP}^c)\), and \(\textit{s(CASP)}\), which also generate explanations for queries to logic programs under the answer set semantics but simplify and ground the programs (the three systems \(\texttt{xClingo}\), \(\texttt{DiscASP}\), \(\textit{exp}(\textit{ASP}^c)\)) or do not always generate all possible explanations (the system \(\textit{s(CASP)}\)). In addition, the output of xASP is insensitive to syntactic variations such as the order conditions and the order of rules, which is also different from the output of \(\textit{s(CASP)}\).
Partially supported by NSF grants 1914635, 1757207, 1812628. This contribution was also made possible in part through the support of NIST via cooperative agreement 70NANB21H167.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
\(p(V \mid V \ne v)\) represents the set of all atoms of the form p(x) except for the atom p(v).
References
Arias, J., Carro, M., Chen, Z., Gupta, G.: Justifications for goal-directed constraint answer set programming. Electron. Proc. Theor. Comput. Sci. 325, 59–72 (2020)
Cabalar, P., Fandinno, J., Muñiz, B.: A system for explainable answer set programming. Electron. Proc. Theor. Comput. Sci. 325, 124–136 (2020)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Logic Programming: Proceedings of the Fifth International Conference and Symposium, pp. 1070–1080 (1988)
Li, F., Wang, H., Basu, K., Salazar, E., Gupta, G.: Discasp: a graph-based asp system for finding relevant consistent concepts with applications to conversational socialbots. arXiv preprint arXiv:2109.08297 (2021)
Pontelli, E., Son, T., El-Khatib, O.: Justifications for logic programs under answer set semantics. TPLP 9(1), 1–56 (2009)
Przymusinski, T.C.: On the declarative semantics of deductive databases and logic programs. In: Foundations of Deductive Databases and Logic Programming (1988)
Trieu, L.L., Son, T.C., Balduccini, M.: exp(aspc): explaining asp programs with choice atoms and constraint rules. Electron. Proc. Theor. Comput. Sci. 345, 155–161 (2021)
Trieu, L.L., Son, T.C., Pontelli, E., Balduccini, M.: Generating explanations for answer set programming applications. In: Artificial Intelligence and Machine Learning for Multi-domain Operations Applications III, pp. 390–403. International Society for Optics and Photonics, SPIE (2021). https://doi.org/10.1117/12.2587517
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Trieu, L.L., Son, T.C., Balduccini, M. (2022). xASP: An Explanation Generation System for Answer Set Programming. In: Gottlob, G., Inclezan, D., Maratea, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2022. Lecture Notes in Computer Science(), vol 13416. Springer, Cham. https://doi.org/10.1007/978-3-031-15707-3_28
Download citation
DOI: https://doi.org/10.1007/978-3-031-15707-3_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-15706-6
Online ISBN: 978-3-031-15707-3
eBook Packages: Computer ScienceComputer Science (R0)