Causal graph justifications of logic programs

DOI10.1017/S1471068414000234MaRDI QIDQ2931267zbMATH OpenOpenAlexWikidataFDO

Authors Pedro Cabalar, Jorge Fandinno, Michael Fink

Publication date 25 November 2014

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

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

zbMATH Keywords

answer set programmingcausalityknowledge representationmulti-valued logic programmingstable model semantics

Mathematics Subject Classification ID

Logic programming (68N17) Knowledge representation (68T30)

Abstract: In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications. These justifications are expressed in terms of causal graphs formed by rule labels and edges that represent their application ordering. For positive programs, we show that the causal justifications obtained for a given atom have a direct correspon- dence to (relevant) syntactic proofs of that atom using the program rules involved in the graphs. The most interesting contribution is that this causal information is obtained in a purely semantic way, by algebraic op- erations (product, sum and application) on a lattice of causal values whose ordering relation expresses when a justification is stronger than another. Finally, for programs with negation, we define the concept of causal stable model by introducing an analogous transformation to Gelfond and Lifschitz's program reduct. As a result, default negation behaves as "absence of proof" and no justification is derived from negative liter

Recommendations

• Justifications for programs with disjunctive and causal-choice rules
• Causal Logic Programming
• A complexity assessment for queries involving sufficient and necessary causes

Cites work

• Causes and Explanations: A Structural-Model Approach. Part I: Causes
• Equilibrium logic
• Explicit provability and constructive semantics
• Free distributive completions of partial complete lattices
• scientific article; zbMATH DE number 1493045 (Why is no real title available?)
• Justifications for logic programs under answer set semantics
• Ramification and causality
• The Semantics of Predicate Logic as a Programming Language

Cited in

(23)

• Propositional description of finite cause-effect structures
• Justifications for logic programming
• Causal Logic Programming
• A complexity assessment for queries involving sufficient and necessary causes
• The Causal Graph Revisited for Directed Model Checking
• A formal theory of justifications
• Towards deriving conclusions from cause-effect relations
• Justifications for programs with disjunctive and causal-choice rules
• Deriving conclusions from non-monotonic cause-effect relations
• Causal dependencies in multiplicative linear logic with MIX
• Limitations of acyclic causal graphs for planning
• scientific article; zbMATH DE number 1453060 (Why is no real title available?)
• scientific article; zbMATH DE number 7455706 (Why is no real title available?)
• scientific article; zbMATH DE number 7455713 (Why is no real title available?)
• Explanation generation for multi-modal multi-agent path finding with optimal resource utilization using answer set programming
• Explaining preferences and preferring explanations
• Introduction to the TPLP Special Issue on User-oriented Logic Programming and Reasoning Paradigms
• Answering the ``why in answer set programming -- a survey of explanation approaches
• scientific article; zbMATH DE number 7121940
• Witnesses for Answer Sets of Logic Programs
• Abstraction for non-ground answer set programs
• Embedding justification theory in approximation fixpoint theory
• Embracing background knowledge in the analysis of actual causality: an answer set programming approach

This page was built for publication: Causal graph justifications of logic programs

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