On elementary loops of logic programs
From MaRDI portal
Publication:2884258
DOI10.1017/S1471068411000019zbMath1242.68050arXiv1012.5847MaRDI QIDQ2884258
Yuliya Lierler, Martin Gebser, Joohyung Lee
Publication date: 24 May 2012
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.5847
Related Items (3)
Paracoherent Answer Set Semantics meets Argumentation Frameworks ⋮ Stepwise debugging of answer-set programs ⋮ Graph-based construction of minimal models
Uses Software
Cites Work
- Stable models and circumscription
- Enhancing disjunctive logic programming systems by SAT checkers
- ASSAT: computing answer sets of a logic program by SAT solvers
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- On the computational cost of disjunctive logic programming: Propositional case
- Propositional semantics for disjunctive logic programs
- Nested expressions in logic programs
- Loop formulas for circumscription
- On the complexity of identifying head-elementary-set-free programs
- On Reductive Semantics of Aggregates in Answer Set Programming
- Some (in)translatability results for normal logic programs and propositional theories
- Negation as failure in the head
- Logic programming and knowledge representation
- Tight logic programs
- Unfolding partiality and disjunctions in stable model semantics
- Why are there so many loop formulas?
- The DLV system for knowledge representation and reasoning
- Head-Elementary-Set-Free Logic Programs
- Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
This page was built for publication: On elementary loops of logic programs
