Justifications for logic programs under answer set semantics
From MaRDI portal
Publication:3612602
DOI10.1017/S1471068408003633zbMath1170.68005OpenAlexW2138596350MaRDI QIDQ3612602
Omar Elkhatib, Enrico Pontelli, Tran Cao Son
Publication date: 10 March 2009
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068408003633
Related Items (27)
Witnesses for Answer Sets of Logic Programs ⋮ Enablers and Inhibitors in Causal Justifications of Logic Programs ⋮ A Formal Theory of Justifications ⋮ Interactive Debugging of Non-ground ASP Programs ⋮ Characterising and Explaining Inconsistency in Logic Programs ⋮ Causal Logic Programming ⋮ Stepwise Debugging of Description-Logic Programs ⋮ Causal Graph Justifications of Logic Programs ⋮ A Complexity Assessment for Queries Involving Sufficient and Necessary Causes ⋮ Unnamed Item ⋮ Generating explanations for biomedical queries ⋮ Justifying answer sets using argumentation ⋮ Justifications for programs with disjunctive and causal-choice rules ⋮ Deriving conclusions from non-monotonic cause-effect relations ⋮ Justifications for Description Logic Knowledge Bases Under the Fixed-Domain Semantics ⋮ Stepwise debugging of answer-set programs ⋮ \texttt{xASP}: an explanation generation system for answer set programming ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Explanation Generation for Multi-Modal Multi-Agent Path Finding with Optimal Resource Utilization using Answer Set Programming ⋮ Explaining Preferences and Preferring Explanations ⋮ Catching the Ouroboros: On debugging non-ground answer-set programs ⋮ Answering the “why” in answer set programming – A survey of explanation approaches ⋮ Debugging Non-ground ASP Programs: Technique and Graphical Tools ⋮ Omission-Based Abstraction for Answer Set Programs ⋮ Abstraction for non-ground answer set programs
Uses Software
Cites Work
- Unnamed Item
- Answer set based design of knowledge systems
- Logic programming and knowledge representation---The A-Prolog perspective
- Answer set programming and plan generation
- Extending and implementing the stable model semantics
- On the equivalence and range of applicability of graph-based representations of logic programs.
- Logic programs with stable model semantics as a constraint programming paradigm
- Graphs and colorings for answer set programming
- The Semantics of Predicate Logic as a Programming Language
- The well-founded semantics for general logic programs
- Logic programming and negation: A survey
- Knowledge Representation, Reasoning and Declarative Problem Solving
- A framework for compiling preferences in logic programs
- Transformation-based bottom-up computation of the well-founded model
- Opium: an extendable trace analyzer for Prolog
- Diagnostic reasoning with A-Prolog
- Bounded LTL model checking with stable models
- The nomore + + Approach to Answer Set Solving
- cr-models: An Inference Engine for CR-Prolog
- Debugging ASP Programs by Means of ASP
- Using Combined Static Analysis and Profiling for Logic Program Execution Time Estimation
- Temporal phylogenetic networks and logic programming
- A machine program for theorem-proving
This page was built for publication: Justifications for logic programs under answer set semantics
