{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:23:39Z","timestamp":1761488619039},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201199"},{"type":"electronic","value":"9783540398530"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39853-0_1","type":"book-chapter","created":{"date-parts":[[2011,1,13]],"date-time":"2011-01-13T06:13:01Z","timestamp":1294899181000},"page":"1-13","source":"Crossref","is-referenced-by-count":2,"title":["A Complete Subsumption Algorithm"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Ferilli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Di Mauro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Teresa M. A.","family":"Basile","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Floriana","family":"Esposito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","volume-title":"Symbolic Logic and Mechanical Theorem Proving","author":"C.L. Chang","year":"1973","unstructured":"Chang, C.L., Lee, R.C.T.: Symbolic Logic and Mechanical Theorem Proving. Academic Press, New York (1973)"},{"key":"1_CR2","first-page":"188","volume-title":"GWAI-81, German Workshop on Artificial Intelligence, Bad Honnef","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, Berlin (1981)"},{"key":"1_CR3","unstructured":"Ferilli, S., Fanizzi, N., Di Mauro, N., Basile, T.M.A.: Efficient \u03b8-subsumption under Object Identity. In: Atti del Workshop AI*IA su Apprendimento Automatico, Siena - Italy (2002)"},{"key":"1_CR4","first-page":"1198","volume-title":"Proceedings of IJCAI 1999","author":"A. Giordana","year":"1999","unstructured":"Giordana, A., Botta, M., Saitta, L.: An experimental study of phase transitions in matching. In: Thomas, D. (ed.) Proceedings of IJCAI 1999, vol.\u00a02, pp. 1198\u20131203. Morgan Kaufmann Publishers, San Francisco (1999)"},{"issue":"2","key":"1_CR5","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":"1_CR6","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":"1_CR7","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.) Proceedings of ICML 1994, pp. 130\u2013138 (1994)","DOI":"10.1016\/B978-1-55860-335-6.50024-6"},{"key":"1_CR8","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, New York (1987)","edition":"2"},{"key":"1_CR9","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)"},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. Journal of the ACM\u00a012(1), 23\u201349 (1965)","journal-title":"Journal of the ACM"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science(LNAI)","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: ILP 1996. Lecture Notes in Computer Science(LNAI), vol.\u00a01314, pp. 212\u2013228. Springer, Heidelberg (1997)"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0304-3975(88)90146-6","volume":"59","author":"M. Schmidt-Schauss","year":"1988","unstructured":"Schmidt-Schauss, M.: Implication of clauses is undecidable. Theoretical Computer Science\u00a059, 287\u2013296 (1988)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"1_CR13","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"},{"issue":"4","key":"1_CR14","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1145\/321784.321792","volume":"20","author":"R.B. Stillman","year":"1973","unstructured":"Stillman, R.B.: The concept of weak substitution in theorem-proving. Journal of ACM\u00a020(4), 648\u2013667 (1973)","journal-title":"Journal of ACM"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2003: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39853-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:33:29Z","timestamp":1558294409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39853-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201199","9783540398530"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39853-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}