{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:19Z","timestamp":1725664399389},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540628583"},{"type":"electronic","value":"9783540687085"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62858-4_80","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:52:10Z","timestamp":1330296730000},"page":"154-161","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A model for generalization based on confirmatory induction"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Lachiche","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Marquis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0004-3702(85)90040-2","volume":"25","author":"G. Bossu","year":"1985","unstructured":"Genevi\u00e8ve Bossu and Pierre Siegel. Saturation, nonmonotonic reasoning and the closed-world assumption. Artificial Intelligence, 25:13\u201363, 1985.","journal-title":"Artificial Intelligence"},{"key":"14_CR2","first-page":"293","volume-title":"Negation as failure","author":"K. L. Clark","year":"1978","unstructured":"Keith L. Clark. Negation as failure. In Herv\u00e9 Gallaire and Jack Minker, editors, Proceedings of the Symposium on Logic and Databases, pages 293\u2013322, New York, 1978. Plenum Press."},{"key":"14_CR3","unstructured":"Peter Flach. Inductive Logic Programming, chapter A framework for Inductive Logic Programming, pages 193\u2013210. S. Muggleton, academic press edition, 1992."},{"key":"14_CR4","unstructured":"Peter Flach. Conjectures: an inquiry concerning the logic of induction. PhD thesis, Tilburg University, 1995."},{"key":"14_CR5","first-page":"267","volume-title":"Proc. TA RK'1996","author":"P. Flach","year":"1996","unstructured":"Peter Flach. Rationality postulates for induction. In Proc. TA RK'1996, pages 267\u2013281, De Zeeuwse Stromen, The Netherlands, 1996."},{"key":"14_CR6","first-page":"149","volume-title":"Proc. KR'89","author":"N. Helft","year":"1989","unstructured":"Nicolas Helft. Induction as nonmonotonic inference. In Proc. KR'89, pages 149\u2013156, Toronto, Canada, 1989. Morgan Kaufmann."},{"issue":"4","key":"14_CR7","doi-asserted-by":"crossref","first-page":"122","DOI":"10.2307\/2271053","volume":"8","author":"C. G. Hempel","year":"1943","unstructured":"C. G. Hempel. A purely syntactical definition of confirmation. Journal of Symbolic Logic, 8(4): 122\u2013143, 1943.","journal-title":"Journal of Symbolic Logic"},{"issue":"213","key":"14_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/mind\/LIV.213.1","volume":"54","author":"C. G. Hempel","year":"1945","unstructured":"C. G. Hempel. Studies in the logic of confirmation. Mind, 54(213 & 214):1\u201326 & 97\u2013121, 1945.","journal-title":"Mind"},{"key":"14_CR9","unstructured":"Nicolas Lachiche and Pierre Marquis. Abduction, induction and completion policies. In Peter Flach, editor, EGAI'96 Workshop on Abductive and Inductive Reasoning, pages 43\u201346, Budapest, Hungary, 1996."},{"key":"14_CR10","first-page":"446","volume-title":"Proc. ECAI'92","author":"P. Marquis","year":"1992","unstructured":"Pierre Marquis. Building up inductive generalizations from facts. In Proc. ECAI'92, pages 446\u2013450, Vienna, Austria, 1992. Wiley & Sons."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"John McCarthy. Circumscription: a form of non-monotonic reasoning. Artificial Intelligence, 13:27\u201339, 1980.","journal-title":"Artificial Intelligence"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"28","author":"J. McCarthy","year":"1986","unstructured":"John McCarthy. Applications of circumscription to formalizing common-sense knowledge. Artificial Intelligence, 28:89\u2013116, 1986.","journal-title":"Artificial Intelligence"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science 138","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/BFb0000066","volume-title":"Proc. CADE'82","author":"J. Minker","year":"1982","unstructured":"Jack Minker. On indefinite databases and the closed world assumption. In Proc. CADE'82, pages 292\u2013308, Berlin, Germany, 1982. Lecture Notes in Computer Science 138, Springer-Verlag."},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19","author":"S. Muggleton","year":"1994","unstructured":"Stephen Muggleton and LucDe Raedt. Inductive logic programming: Theory and methods. Journal of Logic Programming, 19:629\u2013679, 1994.","journal-title":"Journal of Logic Programming"},{"key":"14_CR15","unstructured":"Luc De Raedt and Maurice Bruynooghe. A theory of clausal discovery. In Proc. IJCAI'93, pages 1058\u20131063, Chamb\u00e9ry, France, 1993."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0004-3702(94)90112-0","volume":"70","author":"L. Raedt De","year":"1994","unstructured":"Luc De Raedt and Saso Dzeroski. First-order jk-clausal theories are pac-learnable. Artificial Intelligence, 70:375\u2013392, 1994.","journal-title":"Artificial Intelligence"},{"key":"14_CR17","first-page":"55","volume-title":"On closed-world data base","author":"R. Reiter","year":"1978","unstructured":"Raymond Reiter. On closed-world data base. In Herv\u00e9 Gallaire and Jack Minker, editors, Proceedings of the symposium on logic and data bases, pages 55\u201376, New York, 1978. Plenum Press."},{"key":"14_CR18","first-page":"539","volume-title":"Proc. KR'92","author":"R. Rymon","year":"1992","unstructured":"Ron Rymon. Search through systematic set enumeration. In Proc. KR'92, pages 539\u2013550, Cambridge, Massachusetts, USA, 1992. Morgan Kaufmann."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"John C. Shepherdson. Negation in logic programming. In Jack Minker, editor, Foundations of deductive databases and logic programming, pages 19\u201389, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50005-1"}],"container-title":["Lecture Notes in Computer Science","Machine Learning: ECML-97"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62858-4_80","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:23:57Z","timestamp":1558268637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62858-4_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540628583","9783540687085"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-62858-4_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}