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

Answer Set Programming (ASP) [4, 5] is a popular paradigm for decision making and problem solving in Knowledge Representation and Reasoning. It has been successfully applied in a variety of applications such as robotics, planning, diagnosis, etc. ASP is an attractive programming paradigm as it is a declarative language, where programmers focus on the representation of a specific problem as a set of rules in a logical format, and then leave computational solutions of that problem to an answer set solver. However, this mechanism typically gives little insight into why something is a solution and why some proposed set of literals is not a solution. This type of reasoning falls within the scope of explainable Artificial Intelligence and is useful to enhance the understanding of the resulting solutions as well as for debugging programs. So far, only a limited number of approaches have been proposed [1, 6, 7].