Enablers and Inhibitors in Causal Justifications of Logic Programs

DOI10.1007/978-3-319-23264-5_18zbMath1357.68029arXiv1602.06897OpenAlexW2216709147WikidataQ57718976 ScholiaQ57718976MaRDI QIDQ3449204

Jorge Fandinno, Pedro Cabalar

Publication date: 4 November 2015

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

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

zbMATH Keywords

well-founded semanticslogic programminganswer set programmingstable modelscausal justificationcausal justifications

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items

A Complexity Assessment for Queries Involving Sufficient and Necessary Causes, Answering the “why” in answer set programming – A survey of explanation approaches

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonmonotonic logic and temporal projection
• Ramification and causality
• 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
• Catching the Ouroboros: On debugging non-ground answer-set programs
• Justifications for logic programs under answer set semantics
• The well-founded semantics for general logic programs
• Justifying answer sets using argumentation
• Causes and Explanations: A Structural-Model Approach. Part I: Causes
• Functional and Logic Programming