{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:32:35Z","timestamp":1743057155183,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319780894"},{"type":"electronic","value":"9783319780900"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78090-0_11","type":"book-chapter","created":{"date-parts":[[2018,3,14]],"date-time":"2018-03-14T09:04:58Z","timestamp":1521018298000},"page":"152-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pruning Hypothesis Spaces Using Learned Domain Theories"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0006-3397","authenticated-orcid":false,"given":"Martin","family":"Svato\u0161","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gustav","family":"\u0160ourek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filip","family":"\u017delezn\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Schockaert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ond\u0159ej","family":"Ku\u017eelka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,15]]},"reference":[{"key":"11_CR1","first-page":"50","volume":"7","author":"DL Berre","year":"2010","unstructured":"Berre, D.L., Parrain, A.: The SAT4J library, release 2.2. J. Satisfiability Boolean Model. Comput. 7, 50\u201364 (2010)","journal-title":"J. Satisfiability Boolean Model. Comput."},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0004-3702(88)90001-X","volume":"36","author":"WL Buntine","year":"1988","unstructured":"Buntine, W.L.: Generalized subsumption and its applications to induction and redundancy. Artif. Intell. 36(2), 149\u2013176 (1988)","journal-title":"Artif. Intell."},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(99)00220-0","volume":"239","author":"C Chekuri","year":"2000","unstructured":"Chekuri, C., Rajaraman, A.: Conjunctive query containment revisited. Theor. Comput. Sci. 239(2), 211\u2013229 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR4","volume-title":"Constraint Processing","author":"R Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Elsevier Morgan Kaufmann, San Francisco (2003)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3540635149_40","volume-title":"Inductive Logic Programming","author":"L Dehaspe","year":"1997","unstructured":"Dehaspe, L., De Raedt, L.: Mining association rules in multiple relations. In: Lavra\u010d, N., D\u017eeroski, S. (eds.) ILP 1997. LNCS, vol. 1297, pp. 125\u2013132. Springer, Heidelberg (1997). \n                    https:\/\/doi.org\/10.1007\/3540635149_40"},{"key":"11_CR6","unstructured":"Ferilli, S., Fanizzi, N., Di Mauro, N., Basile, T.M.: Efficient \n                    \n                    $$\\theta $$\n                  -subsumption under object identity. In: 2002 AI*IA Workshop, pp. 59\u201368 (2002)"},{"key":"11_CR7","unstructured":"van Hoeve, W.J.: The alldifferent constraint: A survey (2001). CoRR cs.PL\/0105015. \n                    http:\/\/arxiv.org\/abs\/cs.PL\/0105015"},{"issue":"1","key":"11_CR8","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. Fundam. Inform. 89(1), 95\u2013109 (2008)","journal-title":"Fundam. Inform."},{"issue":"2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10994-010-5208-5","volume":"83","author":"O Ku\u017eelka","year":"2011","unstructured":"Ku\u017eelka, O., \u017delezn\u00fd, F.: Block-wise construction of tree-like relational features with monotone reducibility and redundancy. Mach. Learn. 83(2), 163\u2013192 (2011)","journal-title":"Mach. Learn."},{"issue":"1","key":"11_CR10","first-page":"39","volume":"57","author":"D Malerba","year":"2003","unstructured":"Malerba, D.: Learning recursive theories in the normal ILP setting. Fundam. Inform. 57(1), 39\u201377 (2003)","journal-title":"Fundam. Inform."},{"issue":"2","key":"11_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. Mach. Learn. 55(2), 137\u2013174 (2004)","journal-title":"Mach. Learn."},{"issue":"3\u20134","key":"11_CR12","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 Gen. Comput. 13(3\u20134), 245\u2013286 (1995)","journal-title":"New Gen. Comput."},{"key":"11_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0089-2","volume-title":"Automated Theorem Proving - Theory and Practice","author":"M Newborn","year":"2001","unstructured":"Newborn, M.: Automated Theorem Proving - Theory and Practice. Springer, New York (2001). \n                    https:\/\/doi.org\/10.1007\/978-1-4613-0089-2"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-540-39804-2_32","volume-title":"Knowledge Discovery in Databases: PKDD 2003","author":"S Nijssen","year":"2003","unstructured":"Nijssen, S., Kok, J.N.: Efficient frequent query discovery in Farmer. In: Lavra\u010d, N., Gamberger, D., Todorovski, L., Blockeel, H. (eds.) PKDD 2003. LNCS (LNAI), vol. 2838, pp. 350\u2013362. Springer, Heidelberg (2003). \n                    https:\/\/doi.org\/10.1007\/978-3-540-39804-2_32"},{"issue":"1","key":"11_CR15","first-page":"153","volume":"5","author":"GD Plotkin","year":"1970","unstructured":"Plotkin, G.D.: A note on inductive generalization. Mach. Intell. 5(1), 153\u2013163 (1970)","journal-title":"Mach. Intell."},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0004-3702(97)00041-6","volume":"95","author":"LD Raedt","year":"1997","unstructured":"Raedt, L.D.: Logical settings for concept-learning. Artif. Intell. 95(1), 187\u2013201 (1997)","journal-title":"Artif. Intell."},{"issue":"8","key":"11_CR17","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1016\/j.neunet.2005.07.009","volume":"18","author":"L Ralaivola","year":"2005","unstructured":"Ralaivola, L., Swamidass, S.J., Saigo, H., Baldi, P.: Graph kernels for chemical informatics. Neural Netw. 18(8), 1093\u20131110 (2005)","journal-title":"Neural Netw."},{"key":"11_CR18","unstructured":"Ramon, J., Roy, S., Jonny, D.: Efficient homomorphism-free enumeration of conjunctive queries. In: Preliminary Papers ILP 2011, p. 6 (2011)"},{"key":"11_CR19","unstructured":"Riedel, S.: Improving the accuracy and efficiency of MAP inference for markov logic. In: 24th Conference on Uncertainty in Artificial Intelligence, UAI 2008, pp. 468\u2013475 (2008)"},{"key":"11_CR20","unstructured":"Stepp, R.E., Michalski, R.S.: Conceptual clustering: inventing goal-oriented classifications of structured objects. In: Machine Learning: An Artificial Intelligence Approach, vol. 2, pp. 471\u2013498 (1986)"},{"issue":"1","key":"11_CR21","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.: The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause. Mach. Learn. 76(1), 37\u201372 (2009)","journal-title":"Mach. Learn."},{"issue":"9","key":"11_CR22","first-page":"12","volume":"2","author":"B Weisfeiler","year":"1968","unstructured":"Weisfeiler, B., Lehman, A.: A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Technicheskaya Informatsia 2(9), 12\u201316 (1968)","journal-title":"Nauchno-Technicheskaya Informatsia"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78090-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,11,7]],"date-time":"2018-11-07T12:10:10Z","timestamp":1541592610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-78090-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319780894","9783319780900"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78090-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ILP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Inductive Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Orl\u00e9ans","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ilp2017.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}