{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:36:06Z","timestamp":1725489366565},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410942"},{"type":"electronic","value":"9783540399636"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-39963-1_12","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T03:54:19Z","timestamp":1187236459000},"page":"109-118","source":"Crossref","is-referenced-by-count":1,"title":["Refining Logic Theories under OI-Implication"],"prefix":"10.1007","author":[{"given":"F.","family":"Esposito","sequence":"first","affiliation":[]},{"given":"N.","family":"Fanizzi","sequence":"additional","affiliation":[]},{"given":"S.","family":"Ferilli","sequence":"additional","affiliation":[]},{"given":"G.","family":"Semeraro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,2]]},"reference":[{"key":"12_CR1","volume-title":"Inductive Logic Programming","author":"M. Bain","year":"1992","unstructured":"M. Bain and S.H. Muggleton. Non-monotonic learning. In S.H. Muggleton, editor, Inductive Logic Programming. Academic Press, London, U.K., 1992."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"S. Ceri, G. Gottlob, and L. Tanca. Logic Programming and Databases. Springer, 1990.","DOI":"10.1007\/978-3-642-83952-8"},{"key":"12_CR3","unstructured":"F. Esposito, N. Fanizzi, S. Ferilli, and G. Semeraro. Ideal theory refinement under object identity. In Proceedings of the 17th International Conference on Machine Learning-ICML2000. Morgan Kaufmann, 2000. (forthcoming)."},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"F. Esposito, A. Laterza, D. Malerba, and G. Semeraro. Locally finite, proper and complete operators for refining datalog programs. In Z.W. Ra\u015b and M. Michalewicz, editors, Proceedings of the 9th International Symposium on Methodologies for Intelligent Systems-ISMIS96, volume 1079 of LNAI, pages 468\u2013478. Springer, 1996.","DOI":"10.1007\/3-540-61286-6_171"},{"key":"12_CR5","unstructured":"N. Fanizzi. Refinement Operators in Multistrategy Incremental Learning. Ph.D. thesis, Dipartimento di Informatica, Universit\u00e1 di Bari, Italy, 1999."},{"issue":"2","key":"12_CR6","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":"12_CR7","unstructured":"P. Idestam-Almquist. Generalization of Clauses. Ph.D. thesis, Stockholm University and Royal Institute of Technology, Kiesta, Sweden, 1993."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"J.W. Lloyd. Foundations of Logic Programming. Springer, 2nd edition, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0004-3702(82)90040-6","volume":"18","author":"T.M. Mitchell","year":"1982","unstructured":"T.M. Mitchell. Generalization as search. Artificial Intelligence, 18:203\u2013226, 1982.","journal-title":"Artificial Intelligence"},{"key":"12_CR10","unstructured":"S.H. Muggleton. Inverting implication. In S. Muggleton and K. Furukawa, editors, Proceedings of the 2nd International Workshop on Inductive Logic Programming, ICOT Technical Memorandum TM-1182, 1992."},{"key":"12_CR11","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":"12_CR12","first-page":"153","volume":"5","author":"G.D. Plotkin","year":"1970","unstructured":"G.D. Plotkin. A note on inductive generalization. Machine Intelligence, 5:153\u2013163, 1970.","journal-title":"Machine Intelligence"},{"issue":"1","key":"12_CR13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"J.A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23\u201341, January 1965.","journal-title":"Journal of the ACM"},{"key":"12_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1007\/3-540-49674-2_16","volume-title":"Proceedings of the 7th International Workshop LOPSTR97","author":"G. Semeraro","year":"1998","unstructured":"G. Semeraro, F. Esposito, D. Malerba, N. Fanizzi, and S. Ferilli. A logic framework for the incremental inductive synthesis of datalog theories. In N.E. Fuchs, editor, Proceedings of the 7th International Workshop LOPSTR97, volume 1463 of LNCS, pages 300\u2013321. Springer, 1998."},{"key":"12_CR15","unstructured":"P.R.J. van der Laag. An Analysis of Refinement Operators in Inductive Logic Programming. Ph.D. thesis, Erasmus University, Rotterdam, NL, 1995."}],"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-39963-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T00:11:44Z","timestamp":1556755904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39963-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410942","9783540399636"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-39963-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}