{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:11:49Z","timestamp":1725541909833},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112652"},{"type":"electronic","value":"9783642112669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_11","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T09:04:58Z","timestamp":1260176698000},"page":"132-140","source":"Crossref","is-referenced-by-count":0,"title":["Taming the Complexity of Inductive Logic Programming"],"prefix":"10.1007","author":[{"given":"Filip","family":"\u017delezn\u00fd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"Ku\u017eelka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"volume-title":"Relational Data Mining","year":"2001","key":"11_CR1","unstructured":"D\u017eeroski, S., Lavra\u010d, N. (eds.): Relational Data Mining. Springer, Heidelberg (2001)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1023\/A:1006314320276","volume":"24","author":"C. Gomes","year":"2000","unstructured":"Gomes, C., Selman, B., Crato, N., Kautz, H.: Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems. Journal of Automated Reasoning\u00a024, 67\u2013100 (2000)","journal-title":"Journal of Automated Reasoning"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0020-0190(87)90103-7","volume":"24","author":"G. Gottlob","year":"1987","unstructured":"Gottlob, G.: Subsumption and Implication. Information Processing Letters\u00a024, 109\u2013111 (1987)","journal-title":"Information Processing Letters"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF03037582","volume":"17","author":"G. Gottlob","year":"1999","unstructured":"Gottlob, G., Leone, N., Scarcello, F.: On the Complexity of Some Inductive Logic Programming Problems. New Generation Computing\u00a017, 53\u201375 (1999)","journal-title":"New Generation Computing"},{"key":"11_CR5","unstructured":"Kautz, H., Horvitz, E., Ruan, Y., Gomes, C., Selman, B.: Dynamic Restart Policies. In: AAAI 2002, Association for the Advancement of Artificial Intelligence Symposium (2002)"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1126\/science.264.5163.1297","volume":"264","author":"S. Kirkpatrick","year":"1994","unstructured":"Kirkpatrick, S., Selman, B.: Critical Behavior in the Satisfiability of Random Boolean Expressions. Science\u00a0264, 1297\u20131301 (1994)","journal-title":"Science"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Ku\u017eelka, O., \u017delezn\u00fd, F.: Block-Wise Construction of Acyclic Relational Features with Monotone Irreducibility and Relevancy Properties. In: ICML 2009, the 26th\u00a0Int. Conf. on Machine Learning (2009)","DOI":"10.1145\/1553374.1553448"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Ku\u017eelka, O., \u017delezn\u00fd, F.: Fast Estimation of First-Order Clause Coverage through Randomization and Maximum Likelihood. In: ICML 2008, the 25th\u00a0Int. Conf. on Machine Learning (2008)","DOI":"10.1145\/1390156.1390220"},{"key":"11_CR9","first-page":"95","volume":"89","author":"O. Ku\u017eelka","year":"2008","unstructured":"Ku\u017eelka, O., \u017delezn\u00fd, F.: A Restarted Strategy for Efficient Subsumption Testing. Fundamenta Informaticae\u00a089, 95\u2013109 (2008)","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"11_CR10","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":"11_CR11","unstructured":"Marcinkowski, J., Pacholski, L.: Undecidability of the Horn-Clause Implication Problem. In: FOCS 2002, the 33rd\u00a0Ann. Sympos. on Foundations of Computer Science (2002)"},{"key":"11_CR12","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":"Nienhuys-Cheng, S.H., de Wolf, R.: Foundations of Inductive Logic Programming. Springer, Heidelberg (1997)"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0004-3702(97)00041-6","volume":"95","author":"L.D. Raedt","year":"1997","unstructured":"Raedt, L.D.: Logical Settings for Concept Learning. Artificial Intelligence\u00a095, 187\u2013201 (1997)","journal-title":"Artificial Intelligence"},{"key":"11_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68856-3","volume-title":"Logical and Relational Learning","author":"L.D. Raedt","year":"2008","unstructured":"Raedt, L.D.: Logical and Relational Learning. Springer, Heidelberg (2008)"},{"volume-title":"Probabilistic Inductive Logic Programming","year":"2008","key":"11_CR15","unstructured":"Raedt, L.D., Frasconi, P., Kersting, K., Muggleton, S. (eds.): Probabilistic Inductive Logic Programming. Springer, Heidelberg (2008)"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10994-006-5834-0","volume":"62","author":"F. \u017delezn\u00fd","year":"2006","unstructured":"\u017delezn\u00fd, F., Lavra\u010d, N.: Propositionalization-Based Relational Subgroup Discovery with RSD. Machine Learning\u00a062, 33\u201363 (2006)","journal-title":"Machine Learning"},{"key":"11_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-36468-4_22","volume-title":"Inductive Logic Programming","author":"F. \u017delezn\u00fd","year":"2003","unstructured":"\u017delezn\u00fd, F., Srinivasan, A., Page, D.: Lattice Search Runtime Distributions May Be Heavy Tailed. In: Matwin, S., Sammut, C. (eds.) ILP 2002. LNCS (LNAI), vol.\u00a02583, pp. 333\u2013345. Springer, Heidelberg (2003)"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10994-006-7733-9","volume":"64","author":"F. \u017delezn\u00fd","year":"2006","unstructured":"\u017delezn\u00fd, F., Srinivasan, A., Page, D.: Randomized Restarted Search in ILP. Machine Learning\u00a064, 183\u2013208 (2006)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T04:44:20Z","timestamp":1558673060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}