A Measure of Arbitrariness in Abductive Explanations. Issue 4 (21st July 2014)

• Record Type: Journal Article
• Authors: CAROPRESE, LUCIANO; TRUBITSYNA, IRINA; Truszczyński, Mirosław; Zumpano, Ester; Leuschel, Michael; Schrijvers, Tom
• Is Part Of: Theory and practice of logic programming. Volume 14:Issue 4/5(2014)
• Page Start: 665
• Page End: 679
• Publication Date: 2014-07-21
• Subjects: Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068414000271
• Languages: English
• ISSNs: 1471-0684

Abstract

<abstract abstract-type="normal"> <title>Abstract</title> <p>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 <italic>arbitrariness</italic>: the more arbitrary the explanation, the less appealing it is, with explanations having no arbitrariness — they are called <italic>constrained</italic> — 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.</p> </abstract>