{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:34:26Z","timestamp":1725485666611},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434757"},{"type":"electronic","value":"9783540460169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46016-0_34","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T03:05:14Z","timestamp":1181185514000},"page":"321-330","source":"Crossref","is-referenced-by-count":4,"title":["On the Stability of Example-Driven Learning Systems: A Case Study in Multirelational Learning"],"prefix":"10.1007","author":[{"given":"Lourdes","family":"Pe\u00f1a Castillo","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Wrobel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,7]]},"reference":[{"issue":"4","key":"34_CR1","first-page":"261","volume":"3","author":"P. Clark","year":"1989","unstructured":"Peter Clark and Tim Niblett. The CN2 induction algorithm. Machine Learning, 3(4):261\u2013283, 1989.","journal-title":"Machine Learning"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Hiroshi Fujita, Naoki Yagi, Tomonobu Ozaki, and Koichi Furukawa. A new design and implementation of Progol by bottom-up computation. In S. Muggleton, editor, Inductive Logic Programming, volume 1314 of Lecture Notes in Artificial Intelligence, pages 163\u2013174. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-63494-0_54"},{"issue":"2","key":"34_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF03025367","volume":"22","author":"R. Kaye","year":"2000","unstructured":"Richard Kaye. Minesweeper is NP-complete. The Mathematical Intelligencer, 22(2):9\u201315, Spring 2000.","journal-title":"The Mathematical Intelligencer"},{"key":"34_CR4","unstructured":"Tohgoroh Matsui, Nobuhiro Inuzuka, Hirohisa Seki, and Hidenori Itoh. Comparison of three parallel implementations of an induction algorithm. In Proceedings of 8th International Parallel Computing Workshop, pages 181\u2013188, Singapore, 1998."},{"key":"34_CR5","unstructured":"Ryszard S. Michalski. On the quasi-minimal solution of the general covering problem. In Proceedings of the V International Symposium on Information Processing (FCIP 69), volume A3 (Switching Circuits), pages 125\u2013128, Yugoslavia, Bled, 1969."},{"key":"34_CR6","unstructured":"Tom M. Mitchell. Machine Learning. McGraw Hill, first edition, 1997."},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Stephen Muggleton and Wray L. Buntine. Machine invention of first-order predicates by inverting resolution. In J. Laird, editor, Proceedings of the 5th Conference on Machine Learning, pages 339\u2013352, San Mateo, CA, 1988. Morgan Kaufmann.","DOI":"10.1016\/B978-0-934613-64-4.50040-2"},{"key":"34_CR8","first-page":"281","volume-title":"Inductive Logic Programming","author":"S. Muggleton","year":"1992","unstructured":"Stephen Muggleton and Cao Feng. Efficient induction of logic programs. In Stephen Muggleton, editor, Inductive Logic Programming, volume 38 of APIC Series, pages 281\u2013298. Academic Press, London, 1992."},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Stephen Muggleton and John Firth. Relational rule induction with CProgol4.4: a tutorial introduction. In Sa\u0161o D\u017eeroski and Nada Lavrac, editors, Relational Data Mining, pages 160\u2013187. Springer-Verlag, 2001.","DOI":"10.1007\/978-3-662-04599-2_7"},{"key":"34_CR10","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S. Muggleton","year":"1995","unstructured":"Stephen Muggleton. Inverse entailment and Progol. New Generation Computing Journal, 13:245\u2013286, 1995.","journal-title":"New Generation Computing Journal"},{"key":"34_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-62927-0","volume-title":"Foundations of Inductive Logic Programming","author":"S.-H. Nienhuys-Cheng","year":"1997","unstructured":"Shan-Hwei Nienhuys-Cheng and Ronald de Wolf. Foundations of Inductive Logic Programming, volume 1228 of Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, first edition, February 1997.","edition":"first edition"},{"issue":"3","key":"34_CR12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF03037228","volume":"13","author":"J. Quinlan","year":"1995","unstructured":"J.Ross Quinlan and R. Michael Cameron-Jones. Introduction of logic programs: FOIL and related systems. New Generation Computing, Special issue on Inductive Logic Programming, 13(3\u20134):287\u2013312, 1995.","journal-title":"New Generation Computing"},{"key":"34_CR13","unstructured":"Ashwin Srinivasan, Ross D. King, and Stephen Muggleton. The role of background knowledge: using a problem from chemistry to examine the performance of an ILP program. Transactions on Knowledge and Data Engineering, 1999. under review."}],"container-title":["Lecture Notes in Computer Science","MICAI 2002: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46016-0_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:47:03Z","timestamp":1556480823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46016-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434757","9783540460169"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46016-0_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}