TY - JOUR
T1 - A measure of arbitrariness in abductive explanations
AU - Caroprese, Luciano
AU - Trubitsyna, Irina
AU - Truszczyński, Mirosław
AU - Zumpano, Ester
PY - 2014/7/1
Y1 - 2014/7/1
N2 - We study the framework of abductive logic programming extended with integrity constraints. For this framework, we introduce a new measure of the simplicity of an explanation based on its degree of arbitrariness: the more arbitrary the explanation, the less appealing it is, with explanations having no arbitrariness-they are called constrained-being the preferred ones. In the paper, we study basic properties of constrained explanations. For the case when programs in abductive theories are stratified we establish results providing a detailed picture of the complexity of the problem to decide whether constrained explanations exist.
AB - We study the framework of abductive logic programming extended with integrity constraints. For this framework, we introduce a new measure of the simplicity of an explanation based on its degree of arbitrariness: the more arbitrary the explanation, the less appealing it is, with explanations having no arbitrariness-they are called constrained-being the preferred ones. In the paper, we study basic properties of constrained explanations. For the case when programs in abductive theories are stratified we establish results providing a detailed picture of the complexity of the problem to decide whether constrained explanations exist.
UR - https://www.scopus.com/pages/publications/84992232468
UR - https://www.scopus.com/pages/publications/84992232468#tab=citedBy
U2 - 10.1017/S1471068414000271
DO - 10.1017/S1471068414000271
M3 - Article
AN - SCOPUS:84992232468
SN - 1471-0684
VL - 14
SP - 665
EP - 679
JO - Theory and Practice of Logic Programming
JF - Theory and Practice of Logic Programming
IS - 4-5
ER -