{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:08:36Z","timestamp":1766441316509,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"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_13","type":"book-chapter","created":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T10:22:37Z","timestamp":1277979757000},"page":"131-148","source":"Crossref","is-referenced-by-count":18,"title":["ProGolem: A System Based on Relative Minimal Generalisation"],"prefix":"10.1007","author":[{"given":"Stephen","family":"Muggleton","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Santos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alireza","family":"Tamaddoni-Nezhad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/978-3-540-30109-7_7","volume-title":"Inductive Logic Programming","author":"M. Arias","year":"2004","unstructured":"Arias, M., Khardon, R.: Bottom-up ILP using large refinement steps. In: Camacho, R., King, R., Srinivasan, A. (eds.) ILP 2004. LNCS (LNAI), vol.\u00a03194, pp. 26\u201343. Springer, Heidelberg (2004)"},{"key":"13_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-48751-4_4","volume-title":"Inductive Logic Programming","author":"L. Badea","year":"1999","unstructured":"Badea, L., Stanciu, M.: Refinement operators can be (weakly) perfect. In: D\u017eeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol.\u00a01634, pp. 21\u201332. Springer, Heidelberg (1999)"},{"key":"13_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3-540-44797-0_2","volume-title":"Inductive Logic Programming","author":"R. Basilio","year":"2001","unstructured":"Basilio, R., Zaverucha, G., Barbosa, V.C.: Learning logic programs with neural networks. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol.\u00a02157, pp. 15\u201326. Springer, Heidelberg (2001)"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1162\/153244304773936018","volume":"4","author":"M. Botta","year":"2003","unstructured":"Botta, M., Giordana, A., Saitta, L., Sebag, M.: Relational learning as search in a critical region. J. Mach. Learn. Res.\u00a04, 431\u2013463 (2003)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/507515.507523","volume":"3","author":"J. Cheng","year":"2002","unstructured":"Cheng, J., Hatzis, C., Hayashi, H., Krogel, M., Morishita, S., Page, D., Sese, J.: Kdd cup 2001 report. SIGKDD Explorations\u00a03(2), 47\u201364 (2002)","journal-title":"SIGKDD Explorations"},{"issue":"23","key":"13_CR6","doi-asserted-by":"publisher","first-page":"11322","DOI":"10.1073\/pnas.89.23.11322","volume":"89","author":"R.D. King","year":"1992","unstructured":"King, R.D., Muggleton, S.H., Lewis, R., Sternberg, M.: Drug design by machine learning. Proceedings of the National Academy of Sciences\u00a089(23), 11322\u201311326 (1992)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/BF03037232","volume":"13","author":"R.D. King","year":"1995","unstructured":"King, R.D., Srinivasan, A., Sternberg, M.J.E.: Relating chemical activity to structure: an examination of ILP successes. New Generation Computing\u00a013, 411\u2013433 (1995)","journal-title":"New Generation Computing"},{"key":"13_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/11780496_24","volume-title":"New Frontiers in Artificial Intelligence","author":"M. Kuwabara","year":"2006","unstructured":"Kuwabara, M., Ogawa, T., Hirata, K., Harao, M.: On generalization and subsumption for ordered clauses. In: Washio, T., Sakurai, A., Nakajima, K., Takeda, H., Tojo, S., Yokoo, M. (eds.) JSAI Workshop 2006. LNCS (LNAI), vol.\u00a04012, pp. 212\u2013223. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Kuzelka, O., Zelezn\u00fd, F.: Fast estimation of first-order clause coverage through randomization and maximum likelihood. In: Proceedings of the 25th International Conference (ICML 2008), pp. 504\u2013511 (2008)","key":"13_CR9","DOI":"10.1145\/1390156.1390220"},{"unstructured":"Lee, S.D., De Raedt, L.: Constraint Based Mining of First Order Sequences in SeqLog. In: Database Support for Data Mining Applications, pp. 155\u2013176 (2003)","key":"13_CR10"},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1023\/B:MACH.0000023150.80092.40","volume":"55","author":"J. Maloberti","year":"2004","unstructured":"Maloberti, J., Sebag, M.: Fast theta-subsumption with constraint satisfaction algorithms. Machine Learning\u00a055(2), 137\u2013174 (2004)","journal-title":"Machine Learning"},{"unstructured":"Muggleton, S.: Progol datasets (1996), http:\/\/www.doc.ic.ac.uk\/~shm\/software\/progol4.2\/","key":"13_CR12"},{"key":"13_CR13","first-page":"281","volume-title":"Inductive Logic Programming","author":"S. Muggleton","year":"1992","unstructured":"Muggleton, S., Feng, C.: Efficient induction of logic programs. In: Muggleton, S. (ed.) Inductive Logic Programming, pp. 281\u2013298. Academic Press, London (1992)"},{"key":"13_CR14","first-page":"287","volume-title":"IJCAI 1987","author":"S.H. Muggleton","year":"1987","unstructured":"Muggleton, S.H.: Duce, an oracle based approach to constructive induction. In: IJCAI 1987, pp. 287\u2013292. Kaufmann, San Francisco (1987)"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S.H. Muggleton","year":"1995","unstructured":"Muggleton, S.H.: Inverse entailment and Progol. New Generation Computing\u00a013, 245\u2013286 (1995)","journal-title":"New Generation Computing"},{"key":"13_CR16","first-page":"339","volume-title":"Proceedings of the 5th International Conference on Machine Learning","author":"S.H. Muggleton","year":"1988","unstructured":"Muggleton, S.H., Buntine, W.: Machine invention of first-order predicates by inverting resolution. In: Proceedings of the 5th International Conference on Machine Learning, pp. 339\u2013352. Kaufmann, San Francisco (1988)"},{"issue":"7","key":"13_CR17","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1093\/protein\/5.7.647","volume":"5","author":"S.H. Muggleton","year":"1992","unstructured":"Muggleton, S.H., King, R., Sternberg, M.: Protein secondary structure prediction using logic-based machine learning. Protein Engineering\u00a05(7), 647\u2013657 (1992)","journal-title":"Protein Engineering"},{"issue":"2-3","key":"13_CR18","first-page":"123","volume":"70","author":"S.H. Muggleton","year":"2007","unstructured":"Muggleton, S.H., Tamaddoni-Nezhad, A.: QG\/GA: A stochastic search for Progol. Machine Learning\u00a070(2-3), 123\u2013133 (2007), doi:10.1007\/s10994-007-5029-3","journal-title":"Machine Learning"},{"key":"13_CR19","series-title":"LNCS (LNAI)","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/3-540-62927-0","volume-title":"Foundations of Inductive Logic Programming","author":"S.-H. Nienhuys-Cheng","year":"1997","unstructured":"Nienhuys-Cheng, S.-H., de Wolf, R.: Foundations of Inductive Logic Programming. LNCS (LNAI), vol.\u00a01228, pp. 168\u2013169. Springer, Heidelberg (1997)"},{"unstructured":"Nilsson, N.J.: Principles of Artificial Intelligence. Tioga, Palo Alto (1980)","key":"13_CR20"},{"unstructured":"Plotkin, G.D.: Automatic Methods of Inductive Inference. PhD thesis, Edinburgh University (August 1971)","key":"13_CR21"},{"key":"13_CR22","first-page":"239","volume":"5","author":"J.R. Quinlan","year":"1990","unstructured":"Quinlan, J.R.: Learning logical definitions from relations. Machine Learning\u00a05, 239\u2013266 (1990)","journal-title":"Machine Learning"},{"key":"13_CR23","volume-title":"Proceedings of the 13th International Joint Conference on Artificial Intelligence","author":"L. Raedt De","year":"1993","unstructured":"De Raedt, L., Bruynooghe, M.: A theory of clausal discovery. In: Proceedings of the 13th International Joint Conference on Artificial Intelligence. Morgan Kaufmann, San Francisco (1993)"},{"key":"13_CR24","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0027-5107(01)00289-5","volume":"499","author":"A.M. Richard","year":"2000","unstructured":"Richard, A.M., Williams, C.R.: Distributed structure-searchable toxicity (DSSTox) public database network: A proposal. Mutation Research\u00a0499, 27\u201352 (2000)","journal-title":"Mutation Research"},{"key":"13_CR25","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1192.001.0001","volume-title":"Algorithmic program debugging","author":"E.Y. Shapiro","year":"1983","unstructured":"Shapiro, E.Y.: Algorithmic program debugging. MIT Press, Cambridge (1983)"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/3540635149_56","volume-title":"Inductive Logic Programming","author":"A. Srinivasan","year":"1997","unstructured":"Srinivasan, A., King, R.D., Muggleton, S.H., Sternberg, M.: Carcinogenesis predictions using ILP. In: D\u017eeroski, S., Lavra\u010d, N. (eds.) ILP 1997. LNCS, vol.\u00a01297, pp. 273\u2013287. Springer, Heidelberg (1997)"},{"unstructured":"Srinivasan, A.: The Aleph Manual. University of Oxford (2007)","key":"13_CR27"},{"issue":"1","key":"13_CR28","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10994-009-5117-7","volume":"76","author":"A. Tamaddoni-Nezhad","year":"2009","unstructured":"Tamaddoni-Nezhad, A., Muggleton, S.H.: The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause. Machine Learning\u00a076(1), 37\u201372 (2009)","journal-title":"Machine Learning"}],"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_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T12:49:17Z","timestamp":1740228557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13840-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642138393","9783642138409"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13840-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}