An infinite-game semantics for well-founded negation in logic programming
From MaRDI portal
Publication:2474440
Recommendations
Cites work
- scientific article; zbMATH DE number 4155872 (Why is no real title available?)
- scientific article; zbMATH DE number 1342245 (Why is no real title available?)
- scientific article; zbMATH DE number 1099350 (Why is no real title available?)
- scientific article; zbMATH DE number 1931681 (Why is no real title available?)
- scientific article; zbMATH DE number 1424040 (Why is no real title available?)
- scientific article; zbMATH DE number 3078993 (Why is no real title available?)
- Borel determinacy
- Descriptive set theory
- Fixpoint semantics for logic programming a survey
- Logic programming and knowledge representation
- Logic programming and negation: A survey
- Minimum model semantics for logic programs with negation-as-failure
- Quantitative deduction and its fixpoint theory
- Reasoning with knowledge and belief
- The well-founded semantics for general logic programs
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
- Game semantics for non-monotonic intensional logic programming
- A game semantics for disjunctive logic programming
- Towards Ludics Programming: Interactive Proof Search
- 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)