{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T01:29:05Z","timestamp":1762738145056},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642138393"},{"type":"electronic","value":"9783642138409"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13840-9_12","type":"book-chapter","created":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T06:22:37Z","timestamp":1277965357000},"page":"123-130","source":"Crossref","is-referenced-by-count":7,"title":["Chess Revision: Acquiring the Rules of Chess Variants through FOL Theory Revision from Examples"],"prefix":"10.1007","author":[{"given":"Stephen","family":"Muggleton","sequence":"first","affiliation":[]},{"given":"Aline","family":"Paes","sequence":"additional","affiliation":[]},{"given":"V\u00edtor","family":"Santos Costa","sequence":"additional","affiliation":[]},{"given":"Gerson","family":"Zaverucha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","volume-title":"IUS Chess Federation Official Rules of Chess","author":"D.B. Burg","year":"1987","unstructured":"Burg, D.B., Just, T.: IUS Chess Federation Official Rules of Chess. McKay, New York (1987)"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1023\/A:1007379606734","volume":"28","author":"R. Caruana","year":"1997","unstructured":"Caruana, R.: Multitask Learning. Machine Learning\u00a028(1), 41\u201375 (1997)","journal-title":"Machine Learning"},{"key":"12_CR3","first-page":"111","volume-title":"Proc. of the 5th Int. Conf. and Symp. on Logic Programming","author":"D. Chan","year":"1988","unstructured":"Chan, D.: Constructive Negation Based on the Completed Database. In: Proc. of the 5th Int. Conf. and Symp. on Logic Programming, pp. 111\u2013125. The MIT Press, Cambridge (1988)"},{"issue":"1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF01185404","volume":"32","author":"W. Drabent","year":"1995","unstructured":"Drabent, W.: What is Failure? An Approach to Constructive Negation. Acta Inf.\u00a032(1), 27\u201329 (1995)","journal-title":"Acta Inf."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10994-009-5116-8","volume":"76","author":"A.L. Duboc","year":"2009","unstructured":"Duboc, A.L., Paes, A., Zaverucha, G.: Using the Bottom Clause and Mode Declarations in FOL Theory Revision from Examples. Machine Learning\u00a076, 73\u2013107 (2009)","journal-title":"Machine Learning"},{"key":"12_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-0606-3","volume-title":"Abduction and Induction: Essays on their Relation and Integration","author":"P. Flach","year":"2000","unstructured":"Flach, P., Kakas, A.: Abduction and Induction: Essays on their Relation and Integration. Kluwer Academic Publishers, Dordrecht (2000)"},{"issue":"2","key":"12_CR7","first-page":"147","volume":"26","author":"J. F\u00fcrnkranz","year":"2007","unstructured":"F\u00fcrnkranz, J.: Recent Advances in Machine Learning and Game Playing. OGAI-Journal\u00a026(2), 147\u2013161 (2007)","journal-title":"OGAI-Journal"},{"key":"12_CR8","unstructured":"Goodacre, J.: Master thesis, Inductive Learning of Chess Rules Using Progol. Programming Research Group, Oxford University (1996)"},{"issue":"3&4","key":"12_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S. Muggleton","year":"1995","unstructured":"Muggleton, S.: Inverse Entailment and Progol. New Generation Computing\u00a013(3&4), 245\u2013286 (1995)","journal-title":"New Generation Computing"},{"key":"12_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-44960-4_8","volume-title":"Inductive Logic Programming","author":"S. Muggleton","year":"2000","unstructured":"Muggleton, S., Bryant, C.H.: Theory completion using inverse entailment. In: Cussens, J., Frisch, A.M. (eds.) ILP 2000. LNCS (LNAI), vol.\u00a01866, pp. 130\u2013146. Springer, Heidelberg (2000)"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19\/20","author":"S. Muggleton","year":"1994","unstructured":"Muggleton, S., De Raedt, L.: Inductive Logic Programming: Theory and Methods. J. Log. Program.\u00a019\/20, 629\u2013679 (1994)","journal-title":"J. Log. Program."},{"key":"12_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-78469-2_21","volume-title":"Inductive Logic Programming","author":"A. Paes","year":"2007","unstructured":"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.\u00a04894, pp. 200\u2013210. Springer, Heidelberg (2007)"},{"key":"12_CR13","unstructured":"Pritchard, D.B.: The Classified Encyclopedia of Chess Variants. John Beasley (2007)"},{"issue":"2","key":"12_CR14","first-page":"95","volume":"19","author":"B.L. Richards","year":"1995","unstructured":"Richards, B.L., Mooney, R.J.: Automated Refinement of First-order Horn-Clause Domain Theories. Machine Learning\u00a019(2), 95\u2013131 (1995)","journal-title":"Machine Learning"},{"key":"12_CR15","first-page":"640","volume-title":"Adv. in Neural Inf. Proc. Systems. NIPS","author":"S. Thrun","year":"1995","unstructured":"Thrun, S.: Is Learning the nth Thing any Easier than Learning the First? In: Adv. in Neural Inf. Proc. Systems. NIPS, vol.\u00a08, pp. 640\u2013646. MIT Press, Cambridge (1995)"},{"key":"12_CR16","first-page":"14","volume-title":"Advances in Inductive Logic Programming","author":"S. Wrobel","year":"1996","unstructured":"Wrobel, S.: First-order theory refinement. In: De Raedt, L. (ed.) Advances in Inductive Logic Programming, pp. 14\u201333. IOS Press, Amsterdam (1996)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13840-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T04:43:16Z","timestamp":1552624996000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13840-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642138393","9783642138409"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13840-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}