{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:04:19Z","timestamp":1725483859673},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540437857"},{"type":"electronic","value":"9783540480501"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-48050-1_17","type":"book-chapter","created":{"date-parts":[[2007,5,20]],"date-time":"2007-05-20T08:09:49Z","timestamp":1179648589000},"page":"140-148","source":"Crossref","is-referenced-by-count":0,"title":["Minimal Generalizations under OI-Implication"],"prefix":"10.1007","author":[{"given":"Nicola","family":"Fanizzi","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Ferilli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"L Badea and M. Stanciu. Refinement operators can be (weakly) perfect. In S. D\u017eeroski and P. Flach, editors, Proceedings of the 9th International Workshop on Inductive Logic Programming, volume 1634 of LNAI, pages 21\u201332. Springer, 1999.","DOI":"10.1007\/3-540-48751-4_4"},{"key":"17_CR2","first-page":"15","volume":"47","author":"F. Esposito","year":"2001","unstructured":"F. Esposito, N. Fanizzi, S. Ferilli, and G. Semeraro. A generalization model based on OI-implication for ideal theory refinement. Fundamenta Informaticae, 47:15\u201333, 2001.","journal-title":"Fundamenta Informaticae"},{"key":"17_CR3","unstructured":"F. Esposito, N. Fanizzi, S. Ferilli, and G. Semeraro. OI-implication: Soundness and refutation completeness. In B. Nebel, editor, Proceedings of the 17th International Joint Conference on Artificial Intelligence, pages 847\u2013852, Seattle, WA, 2001."},{"issue":"2","key":"17_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0020-0190(87)90103-7","volume":"24","author":"G. Gottlob","year":"1987","unstructured":"G. Gottlob. Subsumption and implication. Information Processing Letters, 24(2):109\u2013111, 1987.","journal-title":"Information Processing Letters"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(93)90069-N","volume":"61","author":"G. Gottlob","year":"1993","unstructured":"G. Gottlob and C.G. Ferm\u00fcller. Removing redundancy from a clause. Artificial Intelligence, 61:263\u2013289, 1993.","journal-title":"Artificial Intelligence"},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1613\/jair.194","volume":"3","author":"P. Idestam-Almquist","year":"1995","unstructured":"P. Idestam-Almquist. Generalization of clauses under implication. Journal of Artificial Intelligence Research, 3:467\u2013489, 1995.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"3","key":"17_CR7","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1007610422992","volume":"37","author":"R. Khardon","year":"1999","unstructured":"R. Khardon. Learning function-free Horn expressions. Machine Learning, 37(3):241\u2013275, December 1999.","journal-title":"Machine Learning"},{"key":"17_CR8","unstructured":"J\u00f6rg-Uwe Kietz. A comparative study of structural most specific generalisations used in machine learning. In Proceedings of the Third International Workshop on Inductive Logic Programming, pages 149\u2013164, Ljubljana, Slovenia, 1993. J. Stefan Institute Technical Report IJS-DP-6707."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"S.-H. Nienhuys-Cheng and R. de Wolf. Foundations of Inductive Logic Programming, volume 1228 of LNAI. Springer, 1997.","DOI":"10.1007\/3-540-62927-0"},{"key":"17_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":"M. Schmidt-Schauss. Implication of clauses is undecidable. Theoretical Computer Science, 59:287\u2013296, 1988.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Foundations of Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48050-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T05:58:57Z","timestamp":1556431137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48050-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437857","9783540480501"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-48050-1_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}