A game semantics for disjunctive logic programming
From MaRDI portal
Publication:388214
DOI10.1016/j.apal.2013.05.008zbMath1314.68099OpenAlexW1972627011MaRDI QIDQ388214
Publication date: 19 December 2013
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.2013.05.008
Other game-theoretic models (91A40) Semantics in the theory of computing (68Q55) Logic programming (68N17)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A game-theoretic characterization of Boolean grammars
- Fixpoint semantics for logic programming a survey
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- An infinite-game semantics for well-founded negation in logic programming
- Uniform proofs as a foundation for logic programming
- Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming
- Coalgebraic Semantics for Derivations in Logic Programming
- Making prolog more expressive
- Quantitative deduction and its fixpoint theory
- Logic Programming with Focusing Proofs in Linear Logic
- The Semantics of Predicate Logic as a Programming Language
- The well-founded semantics for general logic programs
- Logic programming with sequent systems
- Minimum model semantics for logic programs with negation-as-failure
- A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation