Authors
Stephen Muggleton, Aline Paes, Vítor Santos Costa, Gerson Zaverucha
Publication date
2010
Journal
Inductive Logic Programming
Pages
123-130
Publisher
Springer Berlin/Heidelberg
Description
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 …
Total citations
198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202423231331323214233111212423510111071620202321
Scholar articles
M Bain, S Muggleton - Machine intelligence 13: machine intelligence and …, 1994
S Muggleton, A Paes, V Santos Costa, G Zaverucha - … Logic Programming: 19th International Conference, ILP …, 2010
SH Muggleton - Machine intelligence 11, 1988
S Muggleton, W Buntine - Proc. Workshop on Change of Representation and …, 1988
M Bain - Proceedings of International Workshop on Inductive …, 1992