A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation

DOI10.1007/978-3-540-72200-7_6MaRDI QIDQ5425397zbMATH OpenOpenAlexFDO

Authors

Publication date 13 November 2007

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72200-7_6

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17)

Recommendations

• An infinite-valued semantics for logic programs with negation
• Minimum model semantics for logic programs with negation-as-failure
• scientific article; zbMATH DE number 25192
• An alternative approach to the semantics of disjunctive logic programs and deductive databases
• Minimal founded semantics for disjunctive logic programming

Cited in

(11)

• Relating minimal models and pre-requisite-free normal defaults
• DiMo -- discrete modelling using propositional logic
• A fixed point theorem for non-monotonic functions
• Bottom-up computation of perfect models for disjunctive theories
• A game semantics for disjunctive logic programming
• The infinite-valued semantics: overview, recent results and future directions
• An infinite-valued semantics for logic programs with negation
• Fixpoint characterizations for many-valued disjunctive logic programs with probabilistic semantics
• Logic programming semantics made easy
• Minimum model semantics for logic programs with negation-as-failure
• Contributions to the stable model semantics of logic programs with negation

This page was built for publication: A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5425397)