Justifications for programs with disjunctive and causal-choice rules

DOI10.1017/S1471068416000454zbMATH Open1379.68048arXiv1608.00870OpenAlexW2963938567MaRDI QIDQ4593044FDOQ4593044

Authors: Pedro Cabalar, Jorge Fandinno 

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

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. (Under consideration for publication in Theory and Practice of Logic Programming)

Full work available at URL: https://arxiv.org/abs/1608.00870

Recommendations

• Causal graph justifications of logic programs
• Justifications for logic programming
• scientific article; zbMATH DE number 861624
• Justifications for Logic Programs Under Answer Set Semantics
• Justifications for logic programs under answer set semantics
• scientific article; zbMATH DE number 1531362
• scientific article; zbMATH DE number 1453060
• Conjunctive rules in the theory of belief functions and their justification through decisions models

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Cites Work

• Title not available (Why is that?)
• On the computational cost of disjunctive logic programming: Propositional case
• Title not available (Why is that?)
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Equilibrium logic
• Logic programs with stable model semantics as a constraint programming paradigm
• Title not available (Why is that?)
• Actual causation in CP-logic
• A formal theory of justifications
• Causal graph justifications of logic programs
• Ramification and causality
• Justifying answer sets using argumentation
• Title not available (Why is that?)
• Justifications for logic programming
• Functional and Logic Programming
• Justifications for logic programs under answer set semantics
• A complexity assessment for queries involving sufficient and necessary causes

Cited In (7)

• Explaining preferences and preferring explanations
• Causal graph justifications of logic programs
• A complexity assessment for queries involving sufficient and necessary causes
• Witnesses for Answer Sets of Logic Programs
• Answering the ``why in answer set programming -- a survey of explanation approaches
• Explanation generation for multi-modal multi-agent path finding with optimal resource utilization using answer set programming
• Towards deriving conclusions from cause-effect relations

This page was built for publication: Justifications for programs with disjunctive and causal-choice rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593044)