Complexity of super-coherence problems in ASP
From MaRDI portal
Publication:5418947
DOI10.1017/S147106841300001XzbMath1312.68034arXiv1212.5895OpenAlexW3106488184MaRDI QIDQ5418947
Wolfgang Faber, Stefan Woltran, Mario Alviano
Publication date: 30 May 2014
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.5895
Related Items (2)
Shared aggregate sets in answer set programming ⋮ Enhancing Magic Sets with an Application to Ontological Reasoning
Cites Work
- Unnamed Item
- On the complexity of regular-grammars with integer attributes
- Tie-breaking semantics and structural totality
- On the relations between stable and well-founded semantics of logic programs
- Succinctness as a source of complexity in logical formalisms
- A three-valued semantics for deductive databases and logic programs
- On the computational cost of disjunctive logic programming: Propositional case
- Propositional semantics for disjunctive logic programs
- Logic programming and nonmonotonic reasoning. 8th international conference, LPNMR 2005, Diamante, Italy, September 5--8, 2005. Proceedings.
- Team-building with answer set programming in the Gioia-Tauro seaport
- On the power of magic
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Unfolding partiality and disjunctions in stable model semantics
- The DLV system for knowledge representation and reasoning
- A system of interaction and structure
This page was built for publication: Complexity of super-coherence problems in ASP
