Minimum model semantics for logic programs with negation-as-failure

DOI10.1145/1055686.1055694zbMath1367.68038arXivcs/0306017OpenAlexW2071118378WikidataQ130890661 ScholiaQ130890661MaRDI QIDQ5277727

Panos Rondogiannis, William W. Wadge

Publication date: 12 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0306017

zbMATH Keywords

logic programmingnegation-as-failureinfinite-valued logicswell-founded model

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17) Many-valued logic (03B50)

Related Items (14)

Well-founded semantics for Boolean grammars ⋮ An analysis of the equational properties of the well-founded fixed point ⋮ Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation ⋮ The infinite-valued semantics: overview, recent results and future directions ⋮ A game semantics for disjunctive logic programming ⋮ Equational Properties of Stratified Least Fixed Points (Extended Abstract) ⋮ The intricacies of three-valued extensional semantics for higher-order logic programs ⋮ Logic programming as classical inference ⋮ A game-theoretic characterization of Boolean grammars ⋮ Locally stratified Boolean grammars ⋮ An infinite-game semantics for well-founded negation in logic programming ⋮ A fixed point theorem for non-monotonic functions ⋮ Strong equivalence of logic programs under the infinite-valued semantics ⋮ Extensional Semantics for Higher-Order Logic Programs with Negation

This page was built for publication: Minimum model semantics for logic programs with negation-as-failure