  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).
