.png){kind=icon}
返回
Computing Abductive Explanations
.png){kind=icon}
OA
AI
DOI：10.1109/MIS.2022.3198337.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study the computation of constrained explanations in the framework of abductive logic programming. A general characteristic of abductive reasoning is the existence of multiple abductive explanations. Therefore, identifying a subclass of preferred explanations is a relevant problem. A typical approach is to prefer explanations that are, in some sense, simple. Several concepts of simplicity were considered in the literature, most notably those based on minimality with respect to inclusion and cardinality. We adopt, as a measure of the quality of an explanation, its degree of arbitrariness that can be briefly described as the number of arbitrary assumptions that have been made to derive the explanation. The more arbitrary the explanation, the less appealing it is, with explanations having no arbitrariness, called constrained, being the preferred ones. In this article, we present a technique that, for a special class of theories, computes constrained explanations. It is based on a rewriting of the theory and the observation into a disjunctive logic program with negation so that the constrained explanations correspond to a subset of its stable models. The proposed technique lays the foundation for using ASP solvers to compute constrained explanations.
Keyword:
Symbols
Semantics
Cognition
Logic programming
Security
Intelligent systems
Vocabulary
期刊
IF:
6.1
论文数:
1.6K
被引数:
4.5K
机构
引用论文
Effects of Plasma Glucose Concentration on Glucose Utilization and Glucose Clearance in Normal Man血浆葡萄糖浓度对正常人葡萄糖利用和葡萄糖清除的影响.png)
Diabetes
DiabetesIF0
PREAI
分享收藏
查看更多内容