{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:33:33Z","timestamp":1725564813682},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202561"},{"type":"electronic","value":"9783540395928"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39592-8_53","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T16:29:11Z","timestamp":1283963351000},"page":"384-391","source":"Crossref","is-referenced-by-count":3,"title":["\u03b8-Subsumption and Resolution: A New Algorithm"],"prefix":"10.1007","author":[{"given":"S.","family":"Ferilli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Di Mauro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. M. A.","family":"Basile","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Esposito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"53_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":"53_CR2","first-page":"188","volume-title":"GWAI 1981, German Workshop on Artificial Intelligence","author":"N. Eisinger","year":"1981","unstructured":"Eisinger, N.: Subsumption and connection graphs. In: Siekmann, J.H. (ed.) GWAI 1981, German Workshop on Artificial Intelligence, Bad Honnef, pp. 188\u2013198. Springer, Heidelberg (1981)"},{"issue":"1\/2","key":"53_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"},{"issue":"2","key":"53_CR4","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":"53_CR5","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":"53_CR6","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":"53_CR7","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":"53_CR8","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":"53_CR9","series-title":"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. LNCS (LNAI), vol.\u00a01314, pp. 212\u2013228. Springer, Heidelberg (1997)"},{"key":"53_CR10","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":"4","key":"53_CR11","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","Foundations of Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39592-8_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T02:11:07Z","timestamp":1553047867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39592-8_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202561","9783540395928"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39592-8_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}