A Systematic Solution to the (De-)Composition Problem in General Game Playing

General game players can drastically reduce the cost of search if they are able to solve smaller subproblems individually and synthesise the resulting solutions. To provide a systematic solution to this (de-)composition problem, we start off with generalising the standard decomposition problem in planning by allowing the composition of individual solutions to be further constrained by domain-dependent requirements of the global planning problem. We solve this generalised problem based on a systematic analysis of composition operators for transition systems, and we demonstrate how this solution can be further generalised to general game playing.

[1]  Yngvi Björnsson,et al.  Simulation-Based Approach to General Game Playing , 2008, AAAI.

[2]  Vladimir Lifschitz,et al.  Answer set programming and plan generation , 2002, Artif. Intell..

[3]  Michael R. Genesereth,et al.  General Game Playing: Overview of the AAAI Competition , 2005, AI Mag..

[4]  Eyal Amir,et al.  Factored planning , 2003, IJCAI 2003.

[5]  Ronen I. Brafman,et al.  Factored Planning: How, When, and When Not , 2006, AAAI.

[6]  Michael R. Genesereth,et al.  Factoring General Games using Propositional Automata , 2009 .

[7]  Olivier Buffet,et al.  Factored Planning Using Decomposition Trees , 2007, IJCAI.

[8]  Christel Baier,et al.  Principles of model checking , 2008 .

[9]  Michael R. Genesereth,et al.  The International General Game Playing Competition , 2013, AI Mag..

[10]  Michael Thielscher,et al.  Strategic and Epistemic Reasoning for the Game Description Language GDL-II , 2012, ECAI.

[11]  Stephan Schiffel,et al.  Decomposition of Multi-player Games , 2009, Australasian Conference on Artificial Intelligence.

[12]  Michael Thielscher.  Answer Set Programming for Single-Player Games in General Game Playing , 2009, ICLP.

[13]  Martin Gebser,et al.  Conflict-Driven Answer Set Solving , 2007, IJCAI.

[14]  Thomas G. Dietterich.  Hierarchical Reinforcement Learning with the MAXQ Value Function Decomposition , 1999, J. Artif. Intell. Res..

[15]  Christel Baier,et al.  Principles of Model Checking (Representation and Mind Series) , 2008 .

[16]  Martin Gebser,et al.  Engineering an Incremental ASP Solver , 2008, ICLP.

[17]  Bernhard Hengst,et al.  Discovering Hierarchy in Reinforcement Learning with HEXQ , 2002, ICML.

[18]  Stephan Schiffel,et al.  Factoring General Games , 2009 .