Verification of Games in the Game Description Language

@article{Ruan2009VerificationOG,
  title={Verification of Games in the Game Description Language},
  author={Ji Ruan and Wiebe van der Hoek and Michael Wooldridge},
  journal={J. Log. Comput.},
  year={2009},
  volume={19},
  pages={1127-1156}
}
The Game Description Language (GDL) is a special purpose declarative language for defining games. GDL is used in the AAAI General Game Playing Competition, which tests the ability of computer programs to play games in general, rather than just the ability to play a specific game. Participants in the competition are provided with a previously unknown game specified in GDL, and are required to dynamically and autonomously determine how best to play this game. Recently, there has been much… 

Figures from this paper

Model Checking GDL through MOCHA : A Case Study

TLDR
GDL2RML is presented, a tool enabling model checking ATL formulae of Alternating-time Temporal Logic (ATL) over GDL specifications using MOCHA – an ATL model checker.

Strategic and Epistemic Reasoning for the Game Description Language GDL-II

TLDR
This paper provides a semantic characterisation of GDL-II descriptions in terms of ATEL models, and provides a syntactic translation into ATEL formulas, and it is proved that these two characterisations are equivalent.

The Game Description Language Is Turing Complete

  • Abdallah Saffidine
  • Computer Science
    IEEE Transactions on Computational Intelligence and AI in Games
  • 2014
TLDR
It is shown how to simulate a Turing machine (TM) as a single-player game described in GDL, and it is shown that well formedness as well as some other properties of a GDL description are undecidable.

Representing and Reasoning About the Rules of General Games With Imperfect Information

TLDR
This paper develops a simple yet expressive extension of standard GDL that allows for formalising the rules of arbitrary finite, n-player games with randomness and incomplete state knowledge and develops a full embedding of extended GDL into the Situation Calculus augmented by Scherl and Levesque's knowledge fluent.

Logical-Epistemic Foundations of General Game Descriptions

TLDR
This paper analyses the epistemic structure and expressiveness of this language in terms of modal epistemic logic and proves that GDL is sufficiently expressive to model any situation that can be described by a multi-agent epistemic model.

The Epistemic Logic Behind the Game Description Language

TLDR
This work analyzes the epistemic structure and expressiveness of the game description language GDL in terms of epistemic modal logic and concludes that GDL is sufficiently expressive to model any situation that can be described by a (finite) multi-agent epistemic model.

Situation Calculus Game Structures and GDL

TLDR
It is shown how a player’s possible moves can be specified in a Golog-like programming language by giving a translation of GDL specifications into SCSGSs and showing its correctness.

Automated Theorem Proving for General Game Playing

TLDR
A formal proof method for the automatic acquisition of rich game-specific invariance properties is developed, introducing a simple yet expressive property description language to address knowledge-free game properties which may involve arbitrary finite sequences of successive game states and developing a provably correct formal theory which allows to show the validity of game properties with respect to their semantic across all reachable game states.

GDL Meets ATL: A Logic for Game Description and Strategic Reasoning

TLDR
This paper presents a logical framework that extends the Game Description Language with coalition operators from Alternating-time Temporal Logic and prioritised strategy connectives, and formally derive Weak Determinacy and Zermelo’s Theorem for two-player games.

Automated verification of state sequence invariants in general game playing

References

SHOWING 1-10 OF 33 REFERENCES

Model Checking GDL through MOCHA : A Case Study

TLDR
GDL2RML is presented, a tool enabling model checking ATL formulae of Alternating-time Temporal Logic (ATL) over GDL specifications using MOCHA – an ATL model checker.

Comparing Semantics of Logics for Multi-Agent Systems

TLDR
Models: alternating transition systems, multi-player game models (alias concurrent game structures) and coalition effectivity models turn out to be intimately related, while alternating epistemic transition systems share much of their philosophical and formal apparatus.

On the complexity of practical ATL model checking

TLDR
The complexity of the ATL and Coalition Logic model checking problems for a more "reasonable" model representation known as SRML, a simplified version of the actual model representation languages used for model checkers such as SMV and MOCHA, is investigated.

General Game Playing: Overview of the AAAI Competition

TLDR
An overview of the technical issues and logistics associated with this summer's competition, as well as the relevance of general game playing to the long range-goals of artificial intelligence, are overviewed.

Cooperation, Knowledge, and Time: Alternating-time Temporal Epistemic Logic and its Applications

TLDR
The resulting logic — Alternating-time Temporal Epistemic Logic (ATEL) — shares the tractability of model checking with its ATL parent, and is a succinct and expressive language for reasoning about game-like multiagent systems.

Logic for Mechanism Design A Manifesto

TLDR
This work reviews the mechanism design problem, and discusses a logic (Alternating-time Temporal Logic — ATL), which is well suited to representing and reasoning about strategic encounters, and shows how ATL can be used to formally specify two social choice mechanisms and how current model checkers for ATL can are used to verify properties of these mechanisms.

Satisfiability in Alternating-time Temporal Logic

TLDR
An automata-based decision procedure for ATL is presented, by translating the satisfiability problem for ATL to the nonemptiness problem for the alternating automata on infinite trees, and proving that a satisfiable in a tree model of bounded branching degree is found.

Social laws in alternating time: effectiveness, feasibility, and synthesis

TLDR
This paper shows that the Alternating-time Temporal Logic of Alur, Henzinger, and Kupferman provides an elegant and powerful framework within which to express and understand social laws for multiagent systems.

ATL Satisfiability is Indeed EXPTIME-complete

TLDR
Although none of these variations fixes the set of agents in advance, this paper is able to prove containment in ExpTime for all of them by means of a type elimination construction—thus improving the existing 2ExpTime upper bound to a tight ExpTime one.

Coalition games and alternating temporal logics

TLDR
Equivalence of their semantics is shown, embedding of coalition game logics into alternating-time temporal logic, and axiomatic systems for these logics are proposed.