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

Abstract

We present an enhancement of exp(ASP), a system that generates explanation graphs for a literal -an atom a or its default negation ∼ a-given an answer set A of a normal logic program P, which explain why is true (or false) given A and P. The new system, exp(ASP c ), 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.

Explanations for Answer Set Programming

“…The emergence of XAI has brought significant attention from researchers in ASP community, resulting in numerous proposed systems aimed at addressing this issue such as xclingo [4], DiscASP [9], xASP [19], exp(ASP c ) [18]. However, these systems are incapable of handling one or more of the following scenarios: (i) false atoms can be explained by the system, (ii) the ability to support certain advanced language features.…”