Justifications for programs with disjunctive and causal-choice rules

DOI10.1017/S1471068416000454zbMath1379.68048arXiv1608.00870OpenAlexW2963938567MaRDI QIDQ4593044

Pedro Cabalar, Jorge Fandinno

Publication date: 9 November 2017

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

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

Mathematics Subject Classification ID

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

Related Items (3)

Witnesses for Answer Sets of Logic Programs ⋮ Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming ⋮ Answering the “why” in answer set programming – A survey of explanation approaches

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equilibrium logic
• Ramification and causality
• On the computational cost of disjunctive logic programming: Propositional case
• Logic programs with stable model semantics as a constraint programming paradigm
• Justifications for Logic Programming
• Causal Graph Justifications of Logic Programs
• A Complexity Assessment for Queries Involving Sufficient and Necessary Causes
• Actual causation in CP-logic
• A Formal Theory of Justifications
• Justifications for logic programs under answer set semantics
• Knowledge Representation, Reasoning and Declarative Problem Solving
• Justifying answer sets using argumentation
• Functional and Logic Programming

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