Justifications for programs with disjunctive and causal-choice rules*. Issue 5 (14th October 2016)

• Record Type: Journal Article
• Authors: CABALAR, PEDRO; FANDINNO, JORGE
• Editors: Carro, Manuel; King, Andy
• Is Part Of: Theory and practice of logic programming. Volume 16:Issue 5/6(2016)
• Page Start: 587
• Page End: 603
• Publication Date: 2016-10-14
• Subjects: Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068416000454
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: In this paper, we study an extension of the stable model semantics for disjunctive logic programs where each true atom in a model is associated with an algebraic expression (in terms of rule labels) that represents its justifications. As in our previous work for non-disjunctive programs, these justifications are obtained in a purely semantic way, by algebraic operations (product, addition and application) on a lattice of causal values. Our new definition extends the concept of causal stable model to disjunctive logic programs and satisfies that each (standard) stable model corresponds to a disjoint class of causal stable models sharing the same truth assignments, but possibly varying the obtained explanations. We provide a pair of illustrative examples showing the behaviour of the new semantics and discuss the need of introducing a new type of rule, which we call causal-choice . This type of rule intuitively captures the idea of " A may cause B " and, when causal information is disregarded, amounts to a usual choice rule under the standard stable model semantics.