From here to there: Stable negation in logic programming
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. Stable 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. This 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. For the entire collection see [Zbl 0957.00012].
- Contributions to the stable model semantics of logic programs with negation
- A procedural semantics for well-founded negation in logic programs
- scientific article; zbMATH DE number 4185010
- A transformational approach to negation in logic programming
- On the Expressibility of Stable Logic Programming
- On the expressibility of stable logic programming
- scientific article; zbMATH DE number 92602
- Stable models and their computation for logic programming with inheritance and true negation
- scientific article; zbMATH DE number 4033044
- On the relations between stable and well-founded semantics of logic programs
- Logic programming and knowledge representation---The A-Prolog perspective
- An encompassing framework for paraconsistent logic programs
- Safe beliefs for propositional theories
- Here and there among logics for logic programming
- Stable models and their computation for logic programming with inheritance and true negation
- Logics with Common Weak Completions
- What is in a step: new perspectives on a classical question
- scientific article; zbMATH DE number 2064303 (Why is no real title available?)
- Algebraic semantics for modal and superintuitionistic non-monotonic logics
- Paraconsistent constructive logic with strong negation as a contraction-free relevant logic
- Tableaux for logic programming with strong negation
- scientific article; zbMATH DE number 9973 (Why is no real title available?)
- Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective
- Logic programming with strong negation
- Default Negation as Explicit Negation plus Update
- Epistemic foundation of stable model semantics
- Nonmonotonic inferences: classical conclusions in an intuitionistic modal framework
- Stable reasoning, ASP and the interrogative model of inquiry
- Equilibrium semantics and strong equivalence for higher-order logic programs
- A non-deterministic view on non-classical negations
- A first order nonmonotonic extension of constructive logic
- Equilibrium logic
- Non-classical negation in the works of Helena Rasiowa and their impact on the theory of negation
This page was built for publication: From here to there: Stable negation in logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2715522)
