A Game Semantics Foundation for Logic Programming (Extended Abstract)

  title={A Game Semantics Foundation for Logic Programming (Extended Abstract)},
  author={Roberto Di Cosmo and Jean-Vincent Loddo and Stephane Nicolet},
We introduce a semantics of Logic Programming based on an classical Game Theory, which is proven to be sound and complete w.r.t. the traditional operational semantics and Negation as Failure. This game semantics is based on an abstract reformulation of classical results about two player games, and allows a very simple characterization of the solution set of a logic program in terms of approximations of the value of the game associated to it, which can also be used to capture in a very simple… 
Infinite-game Semantics for Logic Programming Languages
This dissertation is to use infinite games in order to provide an alternative, simple and elegant semantics for logic programming languages and provides for each one of them a corresponding infinite game that captures its semantics.
A game semantics for disjunctive logic programming
A study on parallel semantics of constraint logic programs
This paper presents two parallel semantics of constraint logic programs: multiset answer constraint semantics and game semantics, which differ entirely from the traditional semantics. When giving the
An infinite-game semantics for well-founded negation in logic programming
Infinite Games and Well-Founded Negation
The proof of correctness is based on a refined version of the game, with degrees of winning and losing, which corresponds exactly to the infinite-valued characterization of the well-founded semantics that the author has recently introduced.
An Interactive Approach to Control in Proof Search : Preliminary Results
This short abstract discusses how interactive proof-search allow for an interactive analysis of control (or pruning) mechanisms in logic programming.
Symmetric dialogue games in the proof theory of linear logic
This thesis develops an original approach to the interactive interpretation of the proof theory of linear logic by proposing a model in which the two players have symmetric roles, which shifts from a situation in which a player aims at proving a goal while the other one aims at refuting it.
Proof and refutation in MALL as a game
Playing Logic Programs with the Alpha-Beta Algorithm
It is proved that Alpha-Beta correctly computes the value of a game tree even when these values are chosen in a much wider set of partially ordered domains, which can be pretty far apart from integer and reals, like in the case of the lattice of idempotent substitutions or ex-equations used in logic programming.


Games and full completeness for multiplicative linear logic
It is shown that this semantics yields a categorical model of Linear Logic and proves full completeness for Multiplicative Linear Logic with the MIX rule: every winning strategy is the denotation of a unique cut-free proof net.
The s-Semantics Approach: Theory and Applications
A Game Semantics for Linear Logic
  • A. Blass
  • Philosophy
    Ann. Pure Appl. Log.
  • 1992
A JM's games model is a model of classical Linear Logic.
A subcategory of saturated strategies, closed under all possible codings in copy games, is shown to model reduction in classical Linear Logic.
A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs
A new notion or truth on Herbrand interpretations extended with variables is defined which allows us to capture, by means of suitable models, various observable properties, such as the ground success set, the set of atomic consequences, and the computed answer substitutions operational semantics.
From logic to logic programming
  • K. Doets
  • Computer Science
    Foundations of computing series
  • 1994
From the Publisher: This mathematically oriented introduction to the theory of logic programming presents a systematic exposition of the resolution method for propositional, first-order, and Horn-
Games semantics for full propositional linear logic
  • F. Lamarche
  • Philosophy, Computer Science
    Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science
  • 1995
We present a model of propositional classical linear logic (all the connective except for the additive constants) where the formulas are seen as two person games in which connectives are used as
Algebraic Properties of Idempotent Substitutions
This paper presents an algebra of idempotent substitutions whose operations have many properties and can be regarded as a basis for a theory of concurrent logic programming.
Full Abstraction for PCF
The effective version of the model is considered and it is proved that every element of the effective extensional model is definable in PCF, which is the first syntax-independent description of the fully abstract model for PCF.
Foundations of Logic Programming