{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:21:25Z","timestamp":1752229285109},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201441"},{"type":"electronic","value":"9783540399179"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39917-9_9","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T04:02:15Z","timestamp":1277697735000},"page":"112-129","source":"Crossref","is-referenced-by-count":4,"title":["An Exhaustive Matching Procedure for the Improvement of Learning Efficiency"],"prefix":"10.1007","author":[{"given":"Nicola","family":"Di Mauro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Teresa Maria Altomare","family":"Basile","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Ferilli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Floriana","family":"Esposito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Fanizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","first-page":"188","volume-title":"GWAI-81, German Workshop on Artificial Intelligence","author":"N. Eisinger","year":"1981","unstructured":"Eisinger, N.: Subsumption and connection graphs. In: Siekmann, J.H. (ed.) GWAI-81, German Workshop on Artificial Intelligence, Bad Honnef, pp. 188\u2013198. Springer, Heidelberg (1981)"},{"key":"9_CR2","unstructured":"Esposito, F., Fanizzi, N., Malerba, D., Semeraro, G.: Downward refinement of hierarchical datalog theories. In: Sessa, M.I., Alpuente Frasnedo, M. (eds.) Proceedings of the Joint Conference on Declarative Programming - GULP-PRODE 1995, Universit\u00e0 degli Studi di Salerno, pp. 148\u2013159 (1995)"},{"issue":"1\/2","key":"9_CR3","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1023\/A:1007638124237","volume":"38","author":"F. Esposito","year":"2000","unstructured":"Esposito, F., Semeraro, G., Fanizzi, N., Ferilli, S.: Multistrategy Theory Revision: Induction and abduction in INTHELEX. Machine Learning Journal\u00a038(1\/2), 133\u2013156 (2000)","journal-title":"Machine Learning Journal"},{"key":"9_CR4","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. Freeman, San Francisco (1979)"},{"key":"9_CR5","first-page":"1198","volume-title":"Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI 1999)","author":"A. Giordana","year":"1999","unstructured":"Giordana, A., Botta, M., Saitta, L.: An experimentals tudy of phase transitions in matching. In: Thomas, D. (ed.) Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI 1999), July 31\u2013August 6, vol.\u00a02, pp. 1198\u20131203. Morgan Kaufmann Publishers, San Francisco (1999)"},{"issue":"2","key":"9_CR6","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1145\/3149.214118","volume":"32","author":"G. Gottlob","year":"1985","unstructured":"Gottlob, G., Leitsch, A.: On the efficiency of subsumption algorithms. Journal of the Association for Computing Machinery\u00a032(2), 280\u2013295 (1985)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"9_CR7","unstructured":"Helft, N.: Inductive generalization: A logical framework. In: Bratko, I., Lavra\u010d, N. (eds.) Progress in Machine Learning, Wilmslow, UK, pp. 149\u2013157. Sigma Press (1987)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Kietz, J.-U., L\u00fcbbe, M.: An efficient subsumption algorithm for inductive logic programming. In: Cohen, W., Hirsh, H. (eds.) Proc. Eleventh International Conference on Machine Learning (ML 1994), pp. 130\u2013138 (1994)","DOI":"10.1016\/B978-1-55860-335-6.50024-6"},{"key":"9_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer, Berlin (1987)","edition":"2"},{"key":"9_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-44797-0_14","volume-title":"Inductive Logic Programming","author":"J. Maloberti","year":"2001","unstructured":"Maloberti, J., Sebag, M.: \u03b8-subsumption in a constraint satisfaction perspective. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol.\u00a02157, pp. 164\u2013178. Springer, Heidelberg (2001)"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19","author":"S.H. Muggleton","year":"1994","unstructured":"Muggleton, S.H., De Raedt, L.: Inductive logic programming. Journal of Logic Programming: Theory and Methods\u00a019, 629\u2013679 (1994)","journal-title":"Journal of Logic Programming: Theory and Methods"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Nienhuys-Cheng, S.-H., de Wolf, R.: Foundations of Inductive Logic Programming. LNCS (LNAI), vol.\u00a01228. Springer, Heidelberg (1997)","DOI":"10.1007\/3-540-62927-0"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-63494-0_57","volume-title":"Inductive Logic Programming","author":"T. Scheffer","year":"1997","unstructured":"Scheffer, T., Herbrich, R., Wysotzki, F.: Efficient \u03b8-subsumption based on graph algorithms. In: Muggleton, S. (ed.) ILP 1996. LNCS, vol.\u00a01314, pp. 212\u2013228. Springer, Heidelberg (1997)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/3-540-49674-2_16","volume-title":"Logic Program Synthesis and Transformation","author":"G. Semeraro","year":"1998","unstructured":"Semeraro, G., Esposito, F., Malerba, D., Fanizzi, N., Ferilli, S.: A logic framework for the incrementali nductive synthesis of datalog theories. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol.\u00a01463, pp. 300\u2013321. Springer, Heidelberg (1998)"},{"issue":"1\u20132","key":"9_CR15","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0004-3702(95)00052-6","volume":"81","author":"B.M. Smith","year":"1996","unstructured":"Smith, B.M., Dyer, M.E.: Locating the phase transition in binary constraint satisfaction. Artificial Intelligence\u00a081(1\u20132), 155\u2013181 (1996)","journal-title":"Artificial Intelligence"},{"issue":"1-2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0004-3702(95)00122-0","volume":"85","author":"A. Srinivasan","year":"1996","unstructured":"Srinivasan, A., Muggleton, S., Sternberg, M.J.E., King, R.D.: Theories for mutagenicity: A study in first-order and feature-based induction. Artificial Intelligence\u00a085(1-2), 277\u2013299 (1996)","journal-title":"Artificial Intelligence"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/3-540-15975-4_33","volume-title":"Functional Programming Languages and Computer Architecture","author":"P. Wadler","year":"1985","unstructured":"Wadler, P.: How to replace failure by a list of successes. In: Jouannaud, J.-P. (ed.) FPCA 1985. LNCS, vol.\u00a0201, pp. 113\u2013128. Springer, Heidelberg (1985)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39917-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T03:45:32Z","timestamp":1552621532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39917-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201441","9783540399179"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39917-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}