{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:48:21Z","timestamp":1725536901577},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042379"},{"type":"electronic","value":"9783642042386"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04238-6_16","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T08:23:01Z","timestamp":1251706981000},"page":"169-181","source":"Crossref","is-referenced-by-count":11,"title":["Induction on Failure: Learning Connected Horn Theories"],"prefix":"10.1007","author":[{"given":"Tim","family":"Kimber","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krysia","family":"Broda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandra","family":"Russo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S.H. Muggleton","year":"1995","unstructured":"Muggleton, S.H.: Inverse Entailment and Progol. New Generat. Comput.\u00a013, 245\u2013286 (1995)","journal-title":"New Generat. Comput."},{"key":"16_CR2","unstructured":"Srinivasan, A.: The Aleph Manual, version 4 (2003), \n                    \n                      http:\/\/web.comlab.ox.ac.uk\/oucl\/research\/areas\/machlearn\/Aleph\/index.html"},{"key":"16_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-39917-9_21","volume-title":"Inductive Logic Programming","author":"O. Ray","year":"2003","unstructured":"Ray, O., Broda, K., Russo, A.: Hybrid Abductive Inductive Learning: A Generalisation of Progol. In: Horv\u00e1th, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol.\u00a02835, pp. 311\u2013328. Springer, Heidelberg (2003)"},{"key":"16_CR4","unstructured":"Moyle, S.A.: An Investigation into Theory Completion Techniques in Inductive Logic Programming. PhD thesis, University of Oxford (2000)"},{"key":"16_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-44960-4_8","volume-title":"Inductive Logic Programming","author":"S.H. Muggleton","year":"2000","unstructured":"Muggleton, S.H., Bryant, C.H.: Theory Completion Using Inverse Entailment. In: Cussens, J., Frisch, A.M. (eds.) ILP 2000. LNCS (LNAI), vol.\u00a01866, pp. 130\u2013146. Springer, Heidelberg (2000)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/3540635149_58","volume-title":"Inductive Logic Programming","author":"A. Yamamoto","year":"1997","unstructured":"Yamamoto, A.: Which Hypotheses Can Be Found with Inverse Entailment? In: D\u017eeroski, S., Lavra\u010d, N. (eds.) ILP 1997. LNCS, vol.\u00a01297, pp. 296\u2013308. Springer, Heidelberg (1997)"},{"key":"16_CR7","first-page":"650","volume-title":"16th International Conference on Very Large Databases","author":"A.C. Kakas","year":"1990","unstructured":"Kakas, A.C., Mancarella, P.: Database Updates through Abduction. In: 16th International Conference on Very Large Databases, pp. 650\u2013661. Morgan Kaufmann, San Francisco (1990)"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-16492-8_66","volume-title":"Third International Conference on Logic Programming","author":"H. Tamaki","year":"1986","unstructured":"Tamaki, H., Sato, T.: OLD Resolution with Tabulation. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol.\u00a0225, pp. 84\u201398. Springer, Heidelberg (1986)"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/B:MACH.0000023149.72125.e2","volume":"55","author":"K. Inoue","year":"2004","unstructured":"Inoue, K.: Induction as Consequence Finding. Mach. Learn.\u00a055, 109\u2013135 (2004)","journal-title":"Mach. Learn."},{"key":"16_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-40992-0_12","volume-title":"Algorithmic Learning Theory","author":"A. Yamamoto","year":"2000","unstructured":"Yamamoto, A., Fronh\u00f6fer, B.: Hypotheses Finding via Residue Hypotheses with the Resolution Principle. In: Arimura, H., Sharma, A.K., Jain, S. (eds.) ALT 2000. LNCS (LNAI), vol.\u00a01968, pp. 156\u2013165. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04238-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T16:48:30Z","timestamp":1552150110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04238-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042379","9783642042386"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04238-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}