Chess revision: Acquiring the rules of chess variants through FOL theory revision from examples

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5989 LNAI, Issue , 2010, Pages 123-130

  Muggleton, Stephen ^a   Paes, Aline ^a,b   Santos Costa, Vítor ^c   Zaverucha, Gerson ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^c UNIVERSITY OF PORTO   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

INTELLIGENT REASONING; MACHINE LEARNING SYSTEMS; STANDARD REVISIONS; THEORY REVISION;

ARTIFICIAL INTELLIGENCE; CLASSIFIERS; COMPUTER PROGRAMMING; INDUCTIVE LOGIC PROGRAMMING (ILP); LEARNING ALGORITHMS; LEARNING SYSTEMS;

GAME THEORY;

EID: 77955023450     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13840-9_12     Document Type: Conference Paper

References (16)

1. Burg, D.B., Just, T.: IUS Chess Federation Official Rules of Chess. McKay, New York (1987)
2. Caruana, R.: Multitask Learning. Machine Learning 28(1), 41-75 (1997)
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)
4. Drabent, W.: What is Failure? An Approach to Constructive Negation. Acta Inf. 32(1), 27-29 (1995)
5. Duboc, A.L., Paes, A., Zaverucha, G.: Using the Bottom Clause and Mode Declarations in FOL Theory Revision from Examples. Machine Learning 76, 73-107 (2009)
6. Flach, P., Kakas, A.: Abduction and Induction: Essays on their Relation and Integration. Kluwer Academic Publishers, Dordrecht (2000)
7. Fürnkranz, J.: Recent Advances in Machine Learning and Game Playing. OGAIJournal 26(2), 147-161 (2007)
8. Goodacre, J.: Master thesis, Inductive Learning of Chess Rules Using Progol. Programming Research Group, Oxford University (1996)
9. Muggleton, S.: Inverse Entailment and Progol. New Generation Computing 13(3&4), 245-286 (1995)
10. Muggleton, S., Bryant, C.H.: Theory completion using inverse entailment. In: Cussens, J., Frisch, A.M. (eds.) ILP 2000. LNCS (LNAI), vol.1866, pp. 130-146. Springer, Heidelberg (2000)
11. Muggleton, S., De Raedt, L.: Inductive Logic Programming: Theory and Methods. J. Log. Program. 19/20, 629-679 (1994)
12. Paes, A., Zaverucha, G., Costa, V.S.: Revising FOL Theories from Examples through Stochastic Local Search. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS (LNAI), vol.4894, pp. 200-210. Springer, Heidelberg (2007)
13. Pritchard, D.B.: The Classified Encyclopedia of Chess Variants. John Beasley (2007)
14. Richards, B.L., Mooney, R.J.: Automated Refinement of First-order Horn-Clause Domain Theories. Machine Learning 19(2), 95-131 (1995)
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)
16. Wrobel, S.: First-order theory refinement. In: De Raedt, L. (ed.) Advances in Inductive Logic Programming, pp. 14-33. IOS Press, Amsterdam (1996)