A measure of arbitrariness in abductive explanations

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

Research output: Contribution to journalArticlepeer-review

8 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 languageEnglish
Pages (from-to)665-679
Number of pages15
JournalTheory and Practice of Logic Programming
Volume14
Issue number4-5
DOIs
StatePublished - Jul 1 2014

ASJC Scopus subject areas

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

Fingerprint

Dive into the research topics of 'A measure of arbitrariness in abductive explanations'. Together they form a unique fingerprint.

Cite this