论文标题
可解释的答案集编程的系统
A System for Explainable Answer Set Programming
论文作者
论文摘要
我们提出Xclingo，该工具用于生成带有文本和标签注释的ASP程序的解释。这些注释允许追踪规则或它们得出的原子的应用。 Xclingo的输入是将标记语言写为ASP评论行的标记语言，因此以这种方式注释的程序仍然可以被标准的ASP求解器接受。 Xclingo将注释转化为其他谓词和规则，并使用ASP求解器夹林来获得这些辅助谓词的扩展。此信息之后用于构造包含文本解释的派生树。该语言允许选择哪些原子可以解释以及在这些解释中包含哪些原子或规则。我们通过文献中的诊断问题来说明基本特征。
We present xclingo, a tool for generating explanations from ASP programs annotated with text and labels. These annotations allow tracing the application of rules or the atoms derived by them. The input of xclingo is a markup language written as ASP comment lines, so the programs annotated in this way can still be accepted by a standard ASP solver. xclingo translates the annotations into additional predicates and rules and uses the ASP solver clingo to obtain the extension of those auxiliary predicates. This information is used afterwards to construct derivation trees containing textual explanations. The language allows selecting which atoms to explain and, in its turn, which atoms or rules to include in those explanations. We illustrate the basic features through a diagnosis problem from the literature.
