{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:33Z","timestamp":1725664413647},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540628583"},{"type":"electronic","value":"9783540687085"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62858-4_92","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:52:45Z","timestamp":1330296765000},"page":"274-289","source":"Crossref","is-referenced-by-count":5,"title":["Natural ideal operators in Inductive Logic Programming"],"prefix":"10.1007","author":[{"given":"Fabien","family":"Torre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9line","family":"Rouveirol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0004-3702(88)90001-X","volume":"36","author":"W. Buntine","year":"1988","unstructured":"W. Buntine. Generalized subsumption and its application to induction and redundancy. Artificial Intelligence, 36:375\u2013399, 1988.","journal-title":"Artificial Intelligence"},{"key":"26_CR2","unstructured":"M. Champesme, P. Br\u00e9zellec, and H. Soldano. Empirically conservative search space reductions. In L. De Raedt, editor, Proceedings of the 5th International Workshop on Inductive Logic Programming, pages 387\u2013402. Department of Computer Science, Katholieke Universiteit Leuven, 1995."},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"S. D\u017eeroski, S. Muggleton, and S. Russel. PAC-Learnability of Determinate Logic Programs. In Proceedings of 5th ACM Workshop on Computational Learning Theory, pages 128\u2013135. ACM Press, 1992.","DOI":"10.1145\/130385.130399"},{"key":"26_CR4","unstructured":"F. Esposito, A. Laterza, D. Malerba, and G. Semeraro. Refinement of datalog programs. In Proceedings of the MLnet Familiarization Workshop on Data Mining with Inductive Logic Programming (ILP for KDD), pages 73\u201394, July 1996."},{"issue":"2","key":"26_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0020-0190(87)90103-7","volume":"24","author":"G. Gottlob","year":"1987","unstructured":"Georg Gottlob. Subsumption and implication. Information Processing Letters, 24(2):109\u2013111, January 1987.","journal-title":"Information Processing Letters"},{"key":"26_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"},{"key":"26_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. W. Lloyd","year":"1987","unstructured":"J. W. Lloyd. Foundations of Logic Programming. Springer, Berlin, 2 edition, 1987.","edition":"2 edition"},{"key":"26_CR8","unstructured":"S. Muggleton and C. Feng. Efficient induction of logic programs. In Proceedings of the 1st Conference on Algorithmic Learning Theory, pages 368\u2013381. Ohmsma, Tokyo, Japan, 1990."},{"key":"26_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":"26_CR10","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19","author":"S. Muggleton","year":"1994","unstructured":"S. Muggleton and L. De Raedt. Inductive logic programming: Theory and methods. Journal of Logic Programming, 19:629\u2013679, 1994.","journal-title":"Journal of Logic Programming"},{"key":"26_CR11","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1613\/jair.259","volume":"4","author":"S.H. Nienhuys-Cheng","year":"1996","unstructured":"S.H. Nienhuys-Cheng and R. de Wolf. Least generalizations and greatest specializations of sets of clauses. Journal of Artificial Intelligence Research, 4:341\u2013363, 1996.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"T. Niblett. A note on refinement operators. In P. B. Brazdil, editor, Proceedings of the 6th European Conference on Machine Learning, volume 667 of Lecture Notes in Artificial Intelligence, pages 329\u2013335. Springer-Verlag, April 1993.","DOI":"10.1007\/3-540-56602-3_146"},{"key":"26_CR13","unstructured":"NRA+96. C. N\u00e9dellec, C. Rouveirol, H. Ad\u00e9, F. Bergadano, and B. Tausend. Declarative bias in ILP. In L. De Raedt, editor, Advances in Inductive Logic Programming, pages 82\u2013103. IOS Press, 1996."},{"key":"26_CR14","unstructured":"G. Plotkin. A note on inductive generalization. In Machine Intelligence, volume 5. Edinburgh University Press, 1970."},{"issue":"3","key":"26_CR15","first-page":"239","volume":"5","author":"J. R. Quinlan","year":"1990","unstructured":"J. R. Quinlan. Learning logical definitions from relations. Machine Learning, 5(3):239\u2013266, 1990.","journal-title":"Machine Learning"},{"key":"26_CR16","unstructured":"E. Y. Shapiro. Inductive inference of theories from facts. Technical Report 192, Yale University Department of Computer Science, February 1981."},{"key":"26_CR17","doi-asserted-by":"crossref","unstructured":"F. Torre and C. Rouveirol. Natural ideal operators in inductive logic programming. Technical report, Laboratoire de Recherche en Informatique, Universit\u00e9 Paris Sud, 1997. To appear.","DOI":"10.1007\/3-540-62858-4_92"},{"key":"26_CR18","volume-title":"PhD thesis","author":"P.R.J. Laag van der","year":"1995","unstructured":"P.R.J. van der Laag. An Analysis of Refinement Operators in Inductive Logic Programming. PhD thesis, Erasmus Universiteit, Rotterdam, the Netherlands, 1995."},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"P.R.J van der Laag and S.H. Nienhuys-Cheng. Existence and nonexistence of complete refinement operators. In F. Bergadano and L. de Raedt, editors, Proceedings of the 7th European Conference on Machine Learning, volume 784 of Lecture Notes in Artificial Intelligence, pages 307\u2013322. Springer-Verlag, April 1994.","DOI":"10.1007\/3-540-57868-4_66"},{"key":"26_CR20","unstructured":"P.R.J. van der Laag and S.H. Nienhuys-Cheng. A note on ideal refinement operators in ILP. In S. Wrobel, editor, Proceedings of the 4th International Workshop on Inductive Logic Programming, volume 237 of GMD-Studien, pages 247\u2013262. Gesellschaft f\u00fcr Mathematik und Datenverarbeitung MBH, September 1994."}],"container-title":["Lecture Notes in Computer Science","Machine Learning: ECML-97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62858-4_92.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:14:37Z","timestamp":1605647677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62858-4_92"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540628583","9783540687085"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-62858-4_92","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}