{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:21:12Z","timestamp":1725585672899},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212949"},{"type":"electronic","value":"9783642212956"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21295-6_25","type":"book-chapter","created":{"date-parts":[[2011,6,12]],"date-time":"2011-06-12T22:36:51Z","timestamp":1307918211000},"page":"214-221","source":"Crossref","is-referenced-by-count":0,"title":["When Does It Pay Off to Use Sophisticated Entailment Engines in ILP?"],"prefix":"10.1007","author":[{"given":"Jos\u00e9","family":"Santos","sequence":"first","affiliation":[]},{"given":"Stephen","family":"Muggleton","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1613\/jair.924","volume":"16","author":"H. Blockeel","year":"2002","unstructured":"Blockeel, H., Dehaspe, L., Demoen, B., Janssens, G., Ramon, J., Vandecasteele, H.: Improving the efficiency of Inductive Logic Programming through the use of query packs. J. Artif. Intell. Res. (JAIR)\u00a016, 135\u2013166 (2002)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"25_CR2","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. Journal of Machine Learning Research\u00a04, 431\u2013463 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-540-74610-2_27","volume-title":"Logic Programming","author":"V. Santos Costa","year":"2007","unstructured":"Santos Costa, V., Sagonas, K.F., Lopes, R.: Demand-Driven Indexing of Prolog Clauses. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, pp. 395\u2013409. Springer, Heidelberg (2007)"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1162\/153244304773936027","volume":"4","author":"V. Santos Costa","year":"2003","unstructured":"Santos Costa, V., Srinivasan, A., Camacho, R., Blockeel, H., Demoen, B., Janssens, G., Struyf, J., Vandecasteele, H., Van Laer, W.: Query transformations for improving the efficiency of ILP systems. Journal of Machine Learning Research\u00a04, 465\u2013491 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/3-540-16780-3_113","volume-title":"8th International Conference on Automated Deduction","author":"D. Kapur","year":"1986","unstructured":"Kapur, D., Narendran, P.: Np-completeness of the set unification and matching problems. In: Siekmann, J.H. (ed.) CADE 1986. LNCS, vol.\u00a0230, pp. 489\u2013495. Springer, Heidelberg (1986)"},{"issue":"3\/4","key":"25_CR6","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0004-3702(71)90012-9","volume":"2","author":"R.A. Kowalski","year":"1971","unstructured":"Kowalski, R.A., Kuehner, D.: Linear resolution with selection function. Artif. Intell.\u00a02(3\/4), 227\u2013260 (1971)","journal-title":"Artif. Intell."},{"key":"25_CR7","series-title":"ACM International Conference Proceeding Series","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1145\/1390156.1390220","volume-title":"ICML","author":"O. Kuzelka","year":"2008","unstructured":"Kuzelka, O., Zelezn\u00fd, F.: Fast estimation of first-order clause coverage through randomization and maximum likelihood. In: Cohen, W.W., McCallum, A., Roweis, S.T. (eds.) ICML. ACM International Conference Proceeding Series, vol.\u00a0307, pp. 504\u2013511. ACM, New York (2008)"},{"issue":"1","key":"25_CR8","first-page":"95","volume":"89","author":"O. Kuzelka","year":"2008","unstructured":"Kuzelka, O., Zelezn\u00fd, F.: A restarted strategy for efficient subsumption testing. Fundam. Inform.\u00a089(1), 95\u2013109 (2008)","journal-title":"Fundam. Inform."},{"issue":"2","key":"25_CR9","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":"Markovitch, S., Scott, P.D.: Automatic ordering of subgoals - a machine learning approach. In: NACLP, pp. 224\u2013240 (1989)","key":"25_CR10"},{"key":"25_CR11","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)"},{"issue":"1","key":"25_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J. Alan Robinson","year":"1965","unstructured":"Alan Robinson, J.: A machine-oriented logic based on the resolution principle. J. ACM\u00a012(1), 23\u201341 (1965)","journal-title":"J. ACM"},{"unstructured":"Santos, J., Muggleton, S.: Subsumer: A Prolog theta-subsumption engine. In: Technical communications of the 26th Int. Conference on Logic Programming, Leibniz International Proc. in Informatics, Edinburgh, Scotland (2010)","key":"25_CR13"},{"unstructured":"Sebag, M., Rouveirol, C.: Tractable induction and classification in first order logic via stochastic matching. In: IJCAI, vol.\u00a0(2), pp. 888\u2013893 (1997)","key":"25_CR14"},{"issue":"2","key":"25_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0004-3702(85)90028-1","volume":"26","author":"D.E. Smith","year":"1985","unstructured":"Smith, D.E., Genesereth, M.R.: Ordering conjunctive queries. Artif. Intell.\u00a026(2), 171\u2013215 (1985)","journal-title":"Artif. Intell."}],"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-21295-6_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T13:21:34Z","timestamp":1619788894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21295-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212949","9783642212956"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21295-6_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}