{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:33:46Z","timestamp":1743068026699,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354703"},{"type":"electronic","value":"9783540354710"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780496_24","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T05:37:40Z","timestamp":1151473060000},"page":"212-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On Generalization and Subsumption for Ordered Clauses"],"prefix":"10.1007","author":[{"given":"Megumi","family":"Kuwabara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Ogawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouichi","family":"Hirata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masateru","family":"Harao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,29]]},"reference":[{"key":"25_CR1","unstructured":"Baxter, L.D.: The complexity of unification, Doctoral Thesis, Department of Computer Science, University of Waterloo (1977)"},{"key":"25_CR2","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. Theoretical Computer Science\u00a0239, 211\u2013229 (2000)","journal-title":"Theoretical Computer Science"},{"key":"25_CR3","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-44497-8_8","volume-title":"Database Support for Data Mining Applications","author":"S. Dan Lee","year":"2004","unstructured":"Dan Lee, S., De Raedt, L.: Constraint based mining of first order sequences in seqLog. In: Meo, R., Lanzi, P.L., Klemettinen, M. (eds.) Database Support for Data Mining Applications. LNCS (LNAI), vol.\u00a02682, pp. 154\u2013173. Springer, Heidelberg (2004)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"D\u017eeroski, S., Muggleton, S., Russell, S.: PAC-learnability of determinate logic programs. In: Proc.\u00a05th COLT, pp. 128\u2013135 (1992)","DOI":"10.1145\/130385.130399"},{"key":"25_CR5","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. W.\u00a0H.\u00a0Freeman and Company, New York (1979)"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(93)90069-N","volume":"61","author":"G. Gottlob","year":"1993","unstructured":"Gottlob, G., Ferm\u00fcller, C.G.: Removing redundancy from a clause. Artificial Intelligence\u00a061, 263\u2013289 (1993)","journal-title":"Artificial Intelligence"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/181668.181674","volume":"5","author":"J.-U. Kietz","year":"1994","unstructured":"Kietz, J.-U., D\u017eeroski, S.: Inductive logic programming and learnability. SIGART Bulletin\u00a05, 22\u201332 (1994)","journal-title":"SIGART Bulletin"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Kietz, J.-U., L\u00fcbbe, M.: An efficient subsumption algorithm for inductive logic programming. In: Proc.\u00a011th ICML, pp. 130\u2013138 (1994)","DOI":"10.1016\/B978-1-55860-335-6.50024-6"},{"key":"25_CR9","unstructured":"van der Laag, P.R.J.: An analysis of refinement operators in inductive logic programming, Ph.D. Thesis, Tinbergen Institute (1995)"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/B978-0-934613-40-8.50019-1","volume-title":"Foundations of deductive databases and logic programming","author":"J.-L. Lassez","year":"1988","unstructured":"Lassez, J.-L., Maher, M.J., Marriot, L.: Unification revisited. In: Minker, J. (ed.) Foundations of deductive databases and logic programming, pp. 587\u2013625. Morgan Kaufmann, San Francisco (1988)"},{"key":"25_CR11","doi-asserted-by":"publisher","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 extended edn. Springer, Heidelberg (1987)","edition":"2"},{"key":"25_CR12","series-title":"LNAI","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-62927-0","volume-title":"Foundations of Inductive Logic Programming","author":"S.-H. Nienhuys-Cheng","year":"1997","unstructured":"Nienhuys-Cheng, S.-H., de Wolf, R.: Foundations of Inductive Logic Programming. LNCS (LNAI), vol.\u00a01228. Springer, Heidelberg (1997)"},{"key":"25_CR13","first-page":"153","volume":"5","author":"G.D. Plotkin","year":"1970","unstructured":"Plotkin, G.D.: A note on inductive generalization. Machine Intelligence\u00a05, 153\u2013163 (1970)","journal-title":"Machine Intelligence"},{"key":"25_CR14","first-page":"135","volume":"5","author":"J.C. Reynolds","year":"1970","unstructured":"Reynolds, J.C.: Transformational systems and the algebraic structure of atomic formulas. Machine Intelligence\u00a05, 135\u2013152 (1970)","journal-title":"Machine Intelligence"}],"container-title":["Lecture Notes in Computer Science","New Frontiers in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/11780496_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,4]],"date-time":"2021-09-04T03:44:37Z","timestamp":1630727077000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/11780496_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354703","9783540354710"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11780496_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]},"assertion":[{"value":"29 June 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}