Chess Revision: Acquiring the Rules of Chess Variants through FOL Theory Revision from Examples

The game of chess has been a major testbed for research in artificial intelligence, since it requires focus on intelligent reasoning. Particularly, several challenges arise to machine learning systems when inducing a model describing legal moves of the chess, including the collection of the examples, the learning of a model correctly representing the official rules of the game, covering all the branches and restrictions of the correct moves, and the comprehensibility of such a model. Besides, the game of chess has inspired the creation of numerous variants, ranging from faster to more challenging or to regional versions of the game. The question arises if it is possible to take advantage of an initial classifier of chess as a starting point to obtain classifiers for the different variants. We approach this problem as an instance of theory revision from examples. The initial classifier of chess is inspired by a FOL theory approved by a chess expert and the examples are defined as sequences of moves within a game. Starting from a standard revision system, we argue that abduction and negation are also required to best address this problem. Experimental results show the effectiveness of our approach.

[1]  Peter A. Flach,et al.  Abduction and Induction , 2000 .

[2]  Wlodzimierz Drabent,et al.  What is failure? An approach to constructive negation , 1995, Acta Informatica.

[3]  Luc De Raedt,et al.  Inductive Logic Programming: Theory and Methods , 1994, J. Log. Program..

[4]  Peter A. Flach,et al.  Abduction and induction: essays on their relation and integration , 2000 .

[5]  De Raedt,et al.  Advances in Inductive Logic Programming , 1996 .

[6]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[7]  Sebastian Thrun,et al.  Is Learning The n-th Thing Any Easier Than Learning The First? , 1995, NIPS.

[8]  Gerson Zaverucha,et al.  Using the Bottom Clause and Mode Declarations on FOL Theory Revision from Examples , 2008, ILP.

[9]  TU Darmstadt Hochschulstrasse.  Recent Advances in Machine Learning and Game Playing , 2007 .

[10]  David Chan,et al.  Constructive Negation Based on the Completed Database , 1988, ICLP/SLP.

[11]  Vítor Santos Costa,et al.  Revising First-Order Logic Theories from Examples Through Stochastic Local Search , 2007, ILP.

[12]  Raymond J. Mooney,et al.  Automated refinement of first-order horn-clause domain theories , 2005, Machine Learning.

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

[14]  Rich Caruana,et al.  Multitask Learning , 1998, Encyclopedia of Machine Learning and Data Mining.

[15]  Stephen Muggleton,et al.  Theory Completion Using Inverse Entailment , 2000, ILP.

[16]  S. Wrobel.  First Order Theory Reenement , 1996 .