Learning Games from Videos Guided by Descriptive Complexity

In recent years, several systems have been proposed that learn the rules of a simple card or board game solely from visual demonstration. These systems were constructed for specific games and rely on substantial background knowledge. We introduce a general system for learning board game rules from videos and demonstrate it on several well-known games. The presented algorithm requires only a few demonstrations and minimal background knowledge, and, having learned the rules, automatically derives position evaluation functions and can play the learned games competitively. Our main technique is based on descriptive complexity, i.e. the logical means necessary to define a set of interest. We compute formulas defining allowed moves and final positions in a game in different logics and select the most adequate ones. We show that this method is well-suited for board games and there is strong theoretical evidence that it will generalize to other problems.

[1]  Richard O. Duda,et al.  Use of the Hough transformation to detect lines and curves in pictures , 1972, CACM.

[2]  Ronald Fagin Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[3]  Neil Immerman,et al.  Relational queries computable in polynomial time (Extended Abstract) , 1982, STOC '82.

[4]  Moshe Y. Vardi The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[5]  H. Gaifman On Local and Non-Local Properties , 1982 .

[6]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[7]  John F. Canny,et al.  A Computational Approach to Edge Detection , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[9]  Martin Grohe,et al.  Fixed-point logics on planar graphs , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[10]  Elena Pezzoli,et al.  Computational Complexity of Ehrenfeucht-Fraïssé Games on Finite Structures , 1998, CSL.

[11]  Martin Grohe Equivalence in Finite-Variable Logics is Complete for Polynomial Time , 1999, Comb..

[12]  Erich Grädel,et al.  Why are Modal Logics so Robustly Decidable? , 2001, Bull. EATCS.

[13]  Neil Immerman,et al.  Tree Canonization and Transitive Closure , 2000, Inf. Comput..

[14]  Donald G. Bailey,et al.  Autonomous Game Playing Robot , 2004 .

[15]  Anthony G. Cohn,et al.  Protocols from perceptual observations , 2005, Artif. Intell..

[16]  Phokion G. Kolaitis,et al.  Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series) , 2005 .

[17]  Simon Colton,et al.  Predictive and Descriptive Approaches to Learning Game Rules from Vision Data , 2006, IBERAMIA-SBIA.

[18]  Jaime Simão Sichman,et al.  Advances in Artificial Intelligence - IBERAMIA-SBIA 2006, 2nd International Joint Conference, 10th Ibero-American Conference on AI, 18th Brazilian AI Symposium, Ribeirão Preto, Brazil, October 23-27, 2006, Proceedings , 2006, IBERAMIA-SBIA.

[19]  Maarten Marx,et al.  Finite Model Theory and Its Applications , 2007, Texts in Theoretical Computer Science. An EATCS Series.

[20]  Luc De Raedt,et al.  Probabilistic logical sequence learning for video , 2009, ILP 2009.

[21]  Stephen Muggleton,et al.  Inverse entailment and progol , 1995, New Generation Computing.

[22]  Oleg Verbitsky,et al.  Logical complexity of graphs: a survey , 2010, AMS-ASL Joint Special Session.

[23]  Jeffrey Mark Siskind,et al.  Learning physically-instantiated game play through visual observation , 2010, 2010 IEEE International Conference on Robotics and Automation.

[24]  Martin Grohe,et al.  Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[25]  Shyamanta M. Hazarika,et al.  Learning rules of a card game from video , 2011, Artificial Intelligence Review.

[26]  Lukasz Kaiser,et al.  First-Order Logic with Counting for General Game Playing , 2011, AAAI.

[27]  W. Hanf MODEL-THEORETIC METHODS IN THE STUDY OF ELEMENTARY LOGIC , 2014 .