Decomposition of Games for Efficient Reasoning

  • Eric Schkufza
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4612)


General Game Playing (GGP) is an area of research in artificial intelligence that focuses on the representation of games in terms of an abstract language known as Game Description Language (GDL). The abstract nature of that language allows for the development of intelligent agents that without modification can perform competently on games that they have never seen before based on known properties of GDL’s uniform and compact syntax. Although GDL is an effective tool for communication, it is less useful as a representational framework for reasoning about games. In its place, the Stanford Logic Group has developed a new class of behavioral models, called Propositional Nets (PNs), with which an algorithm has been designed for determining whether games can be decomposed into independent sub-systems that can be reasoned about independently of one another.


  1. 1.
    Love, H., Genesereth.: General Game Playing: Game Description Language Specification. Technical report, Stanford University (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Eric Schkufza
    • 1
  1. 1.Stanford University 

Personalised recommendations