A measure of arbitrariness in abductive explanations

Luciano Caroprese; Irina Trubitsyna; Mirosław Truszczyński; Ester Zumpano

doi:10.1017/S1471068414000271

A measure of arbitrariness in abductive explanations

Luciano Caroprese, Irina Trubitsyna, Mirosław Truszczyński, Ester Zumpano

Computer Science

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	665-679
Number of pages	15
Journal	Theory and Practice of Logic Programming
Volume	14
Issue number	4-5
DOIs	https://doi.org/10.1017/S1471068414000271
State	Published - Jul 1 2014

Funding

Funders	Funder number
U.S. Department of Energy Chinese Academy of Sciences Guangzhou Municipal Science and Technology Project Oak Ridge National Laboratory Extreme Science and Engineering Discovery Environment National Science Foundation National Energy Research Scientific Computing Center National Natural Science Foundation of China	0913459

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computational Theory and Mathematics
Artificial Intelligence

Access to Document

10.1017/S1471068414000271

Cite this

@article{15eae1ec37fd4ee3b78c715751a4d6f7,

title = "A measure of arbitrariness in abductive explanations",

abstract = "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.",

author = "Luciano Caroprese and Irina Trubitsyna and Miros{\l}aw Truszczy{\'n}ski and Ester Zumpano",

year = "2014",

month = jul,

day = "1",

doi = "10.1017/S1471068414000271",

language = "English",

volume = "14",

pages = "665--679",

number = "4-5",

}

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 - http://www.scopus.com/inward/record.url?scp=84992232468&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84992232468&partnerID=8YFLogxK

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 -

A measure of arbitrariness in abductive explanations

Abstract

Funding

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this