{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:04:48Z","timestamp":1766441088631},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642388118"},{"type":"electronic","value":"9783642388125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38812-5_9","type":"book-chapter","created":{"date-parts":[[2013,6,4]],"date-time":"2013-06-04T01:10:03Z","timestamp":1370308203000},"page":"116-129","source":"Crossref","is-referenced-by-count":2,"title":["Bounded Least General Generalization"],"prefix":"10.1007","author":[{"given":"Ond\u0159ej","family":"Ku\u017eelka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Szab\u00f3ov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filip","family":"\u017delezn\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"Plotkin, G.: A note on inductive generalization. Edinburgh University Press (1970)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Foundations of Inductive Logic Programming","year":"1997","unstructured":"Nienhuys-Cheng, S.-H., de Wolf, R. (eds.): Foundations of Inductive Logic Programming. LNCS, vol.\u00a01228. Springer, Heidelberg (1997)"},{"key":"9_CR3","unstructured":"Muggleton, S., Feng, C.: Efficient induction of logic programs. In: ALT, pp. 368\u2013381 (1990)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-13840-9_5","volume-title":"Inductive Logic Programming","author":"T. Horv\u00e1th","year":"2010","unstructured":"Horv\u00e1th, T., Paass, G., Reichartz, F., Wrobel, S.: A logic-based approach to relation extraction from texts. In: De Raedt, L. (ed.) ILP 2009. LNCS, vol.\u00a05989, pp. 34\u201348. Springer, Heidelberg (2010)"},{"key":"9_CR5","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann Publishers (2003)"},{"issue":"2","key":"9_CR6","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"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-73420-8_26","volume-title":"Automata, Languages and Programming","author":"A. Atserias","year":"2007","unstructured":"Atserias, A., Bulatov, A., Dalmau, V.: On the power of k-consistency. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 279\u2013290. Springer, Heidelberg (2007)"},{"key":"9_CR8","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier (2006)"},{"key":"9_CR9","unstructured":"Srinivasan, A., Muggleton, S.H.: Mutagenesis: ILP experiments in a non-determinate biological domain. In: ILP, pp. 217\u2013232 (1994)"},{"issue":"1","key":"9_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1093\/bioinformatics\/17.1.107","volume":"17","author":"C. Helma","year":"2001","unstructured":"Helma, C., King, R.D., Kramer, S., Srinivasan, A.: The predictive toxicology challenge 2000-2001. Bioinformatics\u00a017(1), 107\u2013108 (2001)","journal-title":"Bioinformatics"},{"issue":"12","key":"9_CR11","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.3390\/91201034","volume":"9","author":"A. Cherkasov","year":"2004","unstructured":"Cherkasov, A., Jankovic, B.: Application of \u2018inductive\u2019 qsar descriptors for quantification of antibacterial activity of cationic polypeptides. Molecules\u00a09(12), 1034\u20131052 (2004)","journal-title":"Molecules"},{"key":"9_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-540-73847-3_39","volume-title":"Inductive Logic Programming","author":"M. \u017d\u00e1kov\u00e1","year":"2007","unstructured":"\u017d\u00e1kov\u00e1, M., \u017delezn\u00fd, F., Garcia-Sedano, J.A., Masia Tissot, C., Lavra\u010d, N., K\u0159emen, P., Molina, J.: Relational data mining applied to virtual engineering of product designs. In: Muggleton, S.H., Otero, R., Tamaddoni-Nezhad, A. (eds.) ILP 2006. LNCS (LNAI), vol.\u00a04455, pp. 439\u2013453. Springer, Heidelberg (2007)"},{"key":"9_CR13","first-page":"481","volume":"8","author":"N. Landwehr","year":"2007","unstructured":"Landwehr, N., Kersting, K., De Raedt, L.: Integrating na\u00efve bayes and FOIL. Journal of Machine Learning Research\u00a08, 481\u2013507 (2007)","journal-title":"Journal of Machine Learning Research"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-13840-9_13","volume-title":"Inductive Logic Programming","author":"S. Muggleton","year":"2010","unstructured":"Muggleton, S., Santos, J., Tamaddoni-Nezhad, A.: Progolem: A system based on relative minimal generalisation. In: De Raedt, L. (ed.) ILP 2009. LNCS, vol.\u00a05989, pp. 131\u2013148. Springer, Heidelberg (2010)"},{"key":"9_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-73681-3_25","volume-title":"Conceptual Structures: Knowledge Architectures for Smart Applications","author":"M. Liquiere","year":"2007","unstructured":"Liquiere, M.: Arc consistency projection: A new generalization relation for graphs. In: Priss, U., Polovina, S., Hill, R. (eds.) ICCS 2007. LNCS (LNAI), vol.\u00a04604, pp. 333\u2013346. Springer, Heidelberg (2007)"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10994-010-5193-8","volume":"83","author":"L. Schietgat","year":"2011","unstructured":"Schietgat, L., Costa, F., Ramon, J., De Raedt, L.: Effective feature construction by maximum common subgraph sampling. Machine Learning\u00a083(2), 137\u2013161 (2011)","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-38812-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T17:19:44Z","timestamp":1557767984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38812-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642388118","9783642388125"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38812-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}