On the Complexity of General Game Playing
暂无分享,去创建一个
[1] John T. Gill,et al. Computational complexity of probabilistic Turing machines , 1974, STOC '74.
[2] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..
[3] Michael Thielscher,et al. A General Game Description Language for Incomplete Information Games , 2010, AAAI.
[4] Tom Bylander,et al. The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..
[5] Ana L. N. Fred,et al. Agents and Artificial Intelligence , 2013 .
[6] Michael Thielscher. The General Game Playing Description Language Is Universal , 2011, IJCAI.
[7] Jussi Rintanen,et al. Complexity of Planning with Partial Observability , 2004, ICAPS.
[8] Christos H. Papadimitriou,et al. Games against nature , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[9] A. Meyer. Review: Walter J. Savitch, Relationships between Nondeterministic and Deterministic Tape Complexities , 1974 .
[10] Stephan Schiffel,et al. A Multiagent Semantics for the Game Description Language , 2009, ICAART.
[11] Georg Gottlob,et al. Complexity and expressive power of logic programming , 2001, CSUR.
[12] Michael Wooldridge,et al. Verification of Games in the Game Description Language , 2009, J. Log. Comput..
[13] Michael R. Genesereth,et al. General Game Playing: Overview of the AAAI Competition , 2005, AI Mag..