Positive Dependency Graphs Revisited
Not on the map. Why?
Abstract (arXiv)
Theory of stable models is the mathematical basis of answer set programming. Several results in that theory refer to the concept of the positive dependency graph of a logic program. We describe a modification of that concept and show that the new understanding of positive dependency makes it possible to strengthen some of these results. Under consideration in Theory and Practice of Logic Programming (TPLP).
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 1 of its 26 references that are in the map. First posted on arXiv 18 Jul 2022.
Builds on
1 of 26 references.
References · 1
- 2013Lloyd-Topor Completion and General Stable Modelscited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025On the Boolean Network Theory of Datalog^negcited by 1
- 2025On the Boolean Network Theory of Datalog^neg21 Apr 2025