• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

General Game Playing and the Game Description Language

Thumbnail
Date
2012
Dewey
Intelligence artificielle
Sujet
Multi-Agent Environments; Game Description Language; General game playing
Conference name
Off the Beaten Track: Underrepresented Problems for Programming Language Researchers
Conference date
01-2012
Conference city
Philadelphie
Conference country
États-Unis
URI
https://basepub.dauphine.fr/handle/123456789/9740
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Saffidine, Abdallah
Type
Communication / Conférence
Abstract (EN)
In Artificial Intelligence (AI), General Game Playing (GGP) consists in constructing artificial agents that are able to act rationally in previously unseen environments. Typically, an agent is presented with a description of a new environment and is requested to select an action among a given set of legal actions. Since the programmers do not have prior access to the description of the environment, they cannot encode domain specific knowledge in the agent, and the artificial agent must be able to infer, reason, and learn about its environment on its own. The class of environments an agent may face is called Multi-Agent Environments (MAEs), it features many interacting agents in a deterministic and discrete setting. The agents can take turns or act syn- chronously and can cooperate or have conflicting objectives. For instance, the Travelling Salesman Problem, Chess, the Prisoner’s Dilemma, and six-player Chinese Checkers all fall within the MAE framework. The environment is described to the agents in the Game Description Language (GDL), a declarative and rule based language, related to DATALOG. A state of the MAE corresponds to a set of ground terms and some distinguished predicates allow to compute the legal actions for each agents, the transition function through the effect of the actions, or the rewards each agent is awarded when a final state has been reached. State of the art GGP players currently process GDL through a reduction to PROLOG and using a PROLOG interpreter. As a result, the raw speed of GGP engines is several order of magnitudes slower than that of an engine specialised to one type of environments (e.g. Chess). GGP is now an established research area and has been described as a Grand AI Challenge, but lack of high performance GDL compilers or interpreters is impeding further research development as it creates a high entry barrier for AI practitioners. Although GDL is based on DATALOG and PROLOG, it has many restricting hypotheses and additions over them and constitute an interesting challenge for Programming Language researchers. Particularly, its dynamic MAE semantics offer a complete new range of potential optimisations.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.