An infinite-game semantics for well-founded negation in logic programming

DOI10.1016/J.APAL.2007.10.004zbMATH Open1133.68012OpenAlexW1980849794MaRDI QIDQ2474440FDOQ2474440

Authors: Chrysida Galanaki, Panos Rondogiannis, W. W. Wadge 

Publication date: 6 March 2008

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2007.10.004

Recommendations

• scientific article; zbMATH DE number 1931681
• A game semantics for disjunctive logic programming
• Game characterizations of logic program properties
• Minimum model semantics for logic programs with negation-as-failure
• The well-founded semantics for general logic programs

zbMATH Keywords

infinite gamessemantics of logic programmingnegation in logic programming

Mathematics Subject Classification ID

Logic programming (68N17) Games involving topology, set theory, or logic (91A44) Semantics in the theory of computing (68Q55)

Cites Work

• The well-founded semantics for general logic programs
• Borel determinacy
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Descriptive set theory
• Title not available (Why is that?)
• Logic programming and negation: A survey
• Fixpoint semantics for logic programming a survey
• Quantitative deduction and its fixpoint theory
• Minimum model semantics for logic programs with negation-as-failure
• Logic programming and knowledge representation
• Title not available (Why is that?)
• Reasoning with knowledge and belief
• Title not available (Why is that?)

Cited In (10)

• A game-theoretic characterization of Boolean grammars
• The infinite-valued semantics: overview, recent results and future directions
• Game characterizations of logic program properties
• Towards Ludics Programming: Interactive Proof Search
• Game semantics for non-monotonic intensional logic programming
• A game semantics for disjunctive logic programming
• Proof and refutation in MALL as a game
• A Game-Theoretic Characterization of Boolean Grammars
• Exploiting Game Theory for Analysing Justifications
• Strong equivalence of logic programs under the infinite-valued semantics

This page was built for publication: An infinite-game semantics for well-founded negation in logic programming

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