exp(ASPc) : Explaining ASP Programs with Choice Atoms and Constraint Rules

Ly Ly Trieu
(New Mexico State University)
Tran Cao Son
(New Mexico State University)
Marcello Balduccini
(Saint Joseph's University)

We present an enhancement of exp(ASP), a system that generates explanation graphs for a literal l - an atom a or its default negation ~a - given an answer set A of a normal logic program P, which explain why l is true (or false) given A and P. The new system, exp(ASPc), differs from exp(ASP) in that it supports choice rules and utilizes constraint rules to provide explanation graphs that include information about choices and constraints.

In Andrea Formisano, Yanhong Annie Liu, Bart Bogaerts, Alex Brik, Veronica Dahl, Carmine Dodaro, Paul Fodor, Gian Luca Pozzato, Joost Vennekens and Neng-Fa Zhou: Proceedings 37th International Conference on Logic Programming (Technical Communications) (ICLP 2021), Porto (virtual event), 20-27th September 2021, Electronic Proceedings in Theoretical Computer Science 345, pp. 155–161.
In Proceedings the 37th International Conference on Logic Programming (ICLP 2021)
Published: 17th September 2021.

ArXived at: http://dx.doi.org/10.4204/EPTCS.345.28 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org