Situation calculus game structures and GDL. (English) Zbl 1396.91011

Kaminka, Gal A. (ed.) et al., ECAI 2016. 22nd European conference on artificial intelligence, The Hague, Netherlands, August 29 – September 2, 2016. Proceedings. Including proceedings of the accompanied conference on prestigious applications of intelligent systems (PAIS 2016). In 2 volumes. Amsterdam: IOS Press (ISBN 978-1-61499-671-2/pbk; 978-1-61499-672-9/ebook). Frontiers in Artificial Intelligence and Applications 285, 408-416 (2016).
Summary: We present a situation calculus-based account of multi-players synchronous games in the style of general game playing. Such games can be represented as action theories of a special form, situation calculus synchronous game structures (SCSGSs), in which we have a single action tick whose effects depend on the combination of moves selected by the players. Then one can express properties of the game, e.g., winning conditions, playability, weak and strong winnability, etc. in a first-order alternating-time \(\mu\)-calculus. We discuss verification in this framework considering computational effectiveness. We also show that SCSGSs can be considered as a first-order variant of the game description language (GDL) that supports infinite domains and possibly non-terminating games. We do so by giving a translation of GDL specifications into SCSGSs and showing its correctness. Finally, we show how a player’s possible moves can be specified in a Golog-like programming language.
For the entire collection see [Zbl 1352.68013].


91A06 \(n\)-person games, \(n>2\)
91-04 Software, source code, etc. for problems pertaining to game theory, economics, and finance


Full Text: DOI