{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:28Z","timestamp":1725565408350},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540226710"},{"type":"electronic","value":"9783540277750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27775-0_12","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T16:29:36Z","timestamp":1284568176000},"page":"165-179","source":"Crossref","is-referenced-by-count":1,"title":["Generalised Kernel Sets for Inverse Entailment"],"prefix":"10.1007","author":[{"given":"Oliver","family":"Ray","sequence":"first","affiliation":[]},{"given":"Krysia","family":"Broda","sequence":"additional","affiliation":[]},{"given":"Alessandra","family":"Russo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Aliseda, A.: Seeking Explanations: Abduction in Logic, Philosophy of Science and Artifical Intelligence. PhD thesis, Institute for Logic, Language and Computation (ILLC), University of Amsterdam (1997)"},{"key":"12_CR2","volume-title":"Symbolic Logic and Mechanical Theorem Proving","author":"C. Chang","year":"1973","unstructured":"Chang, C., Lee, R.C.: Symbolic Logic and Mechanical Theorem Proving. Academic Press, London (1973)"},{"key":"12_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-44797-0_6","volume-title":"Inductive Logic Programming","author":"K. Inoue","year":"2001","unstructured":"Inoue, K.: Induction, Abduction, and Consequence-Finding. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol.\u00a02157, pp. 65\u201379. Springer, Heidelberg (2001)"},{"issue":"6","key":"12_CR4","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1093\/logcom\/2.6.719","volume":"2","author":"A.C. Kakas","year":"1992","unstructured":"Kakas, A.C., Kowalski, R.A., Toni, F.: Abductive Logic Programming. Journal of Logic and Computation\u00a02(6), 719\u2013770 (1992)","journal-title":"Journal of Logic and Computation"},{"key":"12_CR5","first-page":"650","volume-title":"16th International Conference on Very Large Databases (VLDB)","author":"A.C. Kakas","year":"1990","unstructured":"Kakas, A.C., Mancarella, P.: Database Updates through Abduction. In: 16th International Conference on Very Large Databases (VLDB), pp. 650\u2013661. Morgan Kaufmann, San Francisco (1990)"},{"issue":"3-4","key":"12_CR6","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S.H. Muggleton","year":"1995","unstructured":"Muggleton, S.H.: Inverse Entailment and Progol. New Generation Computing, Special issue on Inductive Logic Programming\u00a013(3-4), 245\u2013286 (1995)","journal-title":"New Generation Computing, Special issue on Inductive Logic Programming"},{"key":"12_CR7","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":"12_CR8","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19,20","author":"S.H. Muggleton","year":"1994","unstructured":"Muggleton, S.H., De Raedt, L.: Inductive Logic Programming: Theory andMethods. Journal of Logic Programming\u00a019,20, 629\u2013679 (1994)","journal-title":"Journal of Logic Programming"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. In: Nienhuys-Cheng, S.-H., de Wolf, R. (eds.) Foundations of Inductive Logic Programming. LNCS, vol.\u00a01228, Springer, Heidelberg (1997)"},{"key":"12_CR10","unstructured":"Plotkin, G.D.: Automatic Methods of Inductive Inference. PhD thesis, Edinburgh University (1971)"},{"key":"12_CR11","unstructured":"Ray, O.: HAIL: Hybrid Abductive-Inductive Learning. Technical Report 2003\/6, Department of Computing, Imperial College London (2003)"},{"key":"12_CR12","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)"},{"issue":"4","key":"12_CR13","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF00297245","volume":"4","author":"M.E. Stickel","year":"1988","unstructured":"Stickel, M.E.: A Prolog technology theorem prover: Implementation by an extended Prolog compiler. Journal of Automated Reasoning\u00a04(4), 353\u2013380 (1988)","journal-title":"Journal of Automated Reasoning"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"issue":"1","key":"12_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF03037584","volume":"17","author":"A. Yamamoto","year":"1999","unstructured":"Yamamoto, A.: An Inference Method for the Complete Inverse of Relative Subsumption. New Generation Computing\u00a017(1), 99\u2013117 (1999)","journal-title":"New Generation Computing"},{"key":"12_CR16","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.: Hypothesis 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"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27775-0_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:24:33Z","timestamp":1619997873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27775-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226710","9783540277750"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27775-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}