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.
Unable to display preview. Download preview PDF.
- 1.Burg, D.B., Just, T.: IUS Chess Federation Official Rules of Chess. McKay, New York (1987)Google Scholar
- 3.Chan, D.: Constructive Negation Based on the Completed Database. In: Proc. of the 5th Int. Conf. and Symp. on Logic Programming, pp. 111–125. The MIT Press, Cambridge (1988)Google Scholar
- 7.Fürnkranz, J.: Recent Advances in Machine Learning and Game Playing. OGAI-Journal 26(2), 147–161 (2007)Google Scholar
- 8.Goodacre, J.: Master thesis, Inductive Learning of Chess Rules Using Progol. Programming Research Group, Oxford University (1996)Google Scholar
- 13.Pritchard, D.B.: The Classified Encyclopedia of Chess Variants. John Beasley (2007)Google Scholar
- 14.Richards, B.L., Mooney, R.J.: Automated Refinement of First-order Horn-Clause Domain Theories. Machine Learning 19(2), 95–131 (1995)Google Scholar
- 15.Thrun, S.: Is Learning the nth Thing any Easier than Learning the First? In: Adv. in Neural Inf. Proc. Systems. NIPS, vol. 8, pp. 640–646. MIT Press, Cambridge (1995)Google Scholar
- 16.Wrobel, S.: First-order theory refinement. In: De Raedt, L. (ed.) Advances in Inductive Logic Programming, pp. 14–33. IOS Press, Amsterdam (1996)Google Scholar