Enablers and Inhibitors in Causal Justifications of Logic Programs

02/22/2016
by   Pedro Cabalar, et al.
0

To appear in Theory and Practice of Logic Programming (TPLP). In this paper we propose an extension of logic programming (LP) where each default literal derived from the well-founded model is associated to a justification represented as an algebraic expression. This expression contains both causal explanations (in the form of proof graphs built with rule labels) and terms under the scope of negation that stand for conditions that enable or disable the application of causal rules. Using some examples, we discuss how these new conditions, we respectively call "enablers" and "inhibitors", are intimately related to default negation and have an essentially different nature from regular cause-effect relations. The most important result is a formal comparison to the recent algebraic approaches for justifications in LP: "Why-not Provenance" (WnP) and "Causal Graphs" (CG). We show that the current approach extends both WnP and CG justifications under the Well-Founded Semantics and, as a byproduct, we also establish a formal relation between these two approaches.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/25/2014

Causal Graph Justifications of Logic Programs

In this work we propose a multi-valued extension of logic programs under...
08/16/2011

Reiter's Default Logic Is a Logic of Autoepistemic Reasoning And a Good One, Too

A fact apparently not observed earlier in the literature of nonmonotonic...
03/02/2012

(Dual) Hoops Have Unique Halving

Continuous logic extends the multi-valued Lukasiewicz logic by adding a ...
05/18/2019

Strong equivalence for LP^MLN programs

Strong equivalence is a well-studied and important concept in answer set...
03/03/2015

Combining Probabilistic, Causal, and Normative Reasoning in CP-logic

In recent years the search for a proper formal definition of actual caus...
06/07/2018

Logic Programming as a Service

New generations of distributed systems are opening novel perspectives fo...
04/29/2014

Generalizing Modular Logic Programs

Even though modularity has been studied extensively in conventional logi...