From here to there: Stable negation in logic programming (Q2715522)

The aim of the paper is to select one particular approach to logic programming semantics, that of stable models, and to analyse its treatment of negation from a purely logical point of view.NEWLINENEWLINENEWLINEStable models yield a kind of completion semantics. The notion of completion is the more traditional one in logic: every stable model determines a theory complete in \((\neg)\). But this idea, that, given some program, a query formula either succeeds or fails, is not the only principle underlying the semantics. Reasoning on the basis of stable models or answer set is also a form of minimal model reasoning, familiar elsewhere in logic programming and in nonmonotonic logic generally.NEWLINENEWLINENEWLINEThis juxtaposition of minimality and completeness, which combines to form negation stability, is what distinguishes stable model reasoning from other approaches. The extension to strong negation is straightforward and conservative.NEWLINENEWLINEFor the entire collection see [Zbl 0957.00012].