The paper presents an enhancement of xASP, a system that generates explanation graphs for Answer Set Programming (ASP). Different from xASP, the new system, xASP2, supports different clingo constructs like the choice rules, the constraints, and the aggregates such as #sum, #min. This work formalizes and presents an explainable artificial intelligence system for a broad fragment of ASP, capable of shrinking as much as possible the set of assumptions and presenting explanations in terms of directed acyclic graphs.

翻译：本文提出了对xASP系统的增强，该系统可为答案集编程生成解释图。与xASP不同，新系统xASP2支持不同的clingo结构，如选择规则、约束条件以及#sum、#min等聚合函数。本研究形式化并展示了一个可解释的人工智能系统，适用于答案集编程的广泛片段，能够尽可能缩减假设集合，并以有向无环图的形式呈现解释。