{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:08Z","timestamp":1725455828907},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540644170"},{"type":"electronic","value":"9783540697817"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0026694","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T08:27:35Z","timestamp":1132388855000},"page":"238-249","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An inductive logic programming framework to learn a concept from ambiguous examples"],"prefix":"10.1007","author":[{"given":"Dominique","family":"Bouthinon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henry","family":"Soldano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"issue":"8","key":"30_CR1","doi-asserted-by":"publisher","first-page":"1395","DOI":"10.1093\/nar\/24.8.1395","volume":"24","author":"B. Billoud","year":"1996","unstructured":"B. Billoud, M. Kontic and A. Viari, Palingol: a declarative programming language to describe nucleic acids' secondary structures and to scan sequence databases, Nucleic Acids Research, vol 24, n\u00b0 8, pp. 1395\u20131403, 1996.","journal-title":"Nucleic Acids Research"},{"key":"30_CR2","unstructured":"D. Bouthinon, Apprentissage \u00e0 Partir d'Exemples Ambigus: Etude Th\u00e9orique and Application \u00e0 la D\u00e9couverte de Structures Communes \u00e0 un Ensemble de S\u00e9quences d'ARN, doctorat de l'universit\u00e9 Paris XIII-Institut Galil\u00e9e, 1996."},{"key":"30_CR3","unstructured":"D. Bouthinon, H. Soldano and B. Billoud, Apprentissage d'un concept commun \u00e1 un ensemble d'objets dont la description est hypoth\u00e9tique: application \u00e1 la d\u00e9couverte de structures secondaires d'ARN, Journ\u00e9es Francophones d'Apprentissage, S\u00e9tes (France), pp. 206\u2013220, 1996."},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"W. Buntime, Generalized subsumption and its applications to induction and redundancy, Artificial Intelligence, pp. 149\u2013176, 1988.","DOI":"10.1016\/0004-3702(88)90001-X"},{"issue":"1\u20132","key":"30_CR5","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0004-3702(80)90012-0","volume":"13","author":"D. MacDermott","year":"1980","unstructured":"D. MacDermott and J. Doyle, Non-monotonie logic I, Artificial Intelligence, vol. 13, n\u00b0 1\u20132, pp.41\u201372, 1980.","journal-title":"Artificial Intelligence"},{"issue":"1\u20132","key":"30_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0004-3702(96)00034-3","volume":"89","author":"T.G. Dietterich","year":"1997","unstructured":"T.G. Dietterich, R.H. Lathrop and T. Lozano-Perez, Solving the Multiple-Instance Problem with Axis-Parallel Rectangles, Artificial Intelligence, vol 89(1\u20132), pp. 31\u201371, 1997.","journal-title":"Artificial Intelligence"},{"key":"30_CR7","unstructured":"P.A. Flach, A Framework for Inductive Logic Programming, Inductive Logic Programming, 1992."},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"R.M. Karp, R.E. Miller and A.L. Rosenberg, Rapid identification of repeated patterns in strings, trees and arrays, Proc. 4th Annu. ACM Symp. Theory of Computing, pp. 125\u2013136, 1972.","DOI":"10.1145\/800152.804905"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"J.U. Kietz and M. L\u00fcbbe, An efficient subsumption algorithm for inductive logic programming, Machine Learning, pp. 130\u2013138, 1994.","DOI":"10.1016\/B978-1-55860-335-6.50024-6"},{"key":"30_CR10","volume-title":"Applications of artificial intelligence to organic chemistry: The Dendra projects","author":"R. Lindsay","year":"1980","unstructured":"R. Lindsay, B. Buchanan, E. Feigenbaum and J. Lederberg, Applications of artificial intelligence to organic chemistry: The Dendra projects, New-York McGraw-Hill., 1980."},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"S. Muggleton, Inductive Logic Programming, Inductive Logic Programming, 1992.","DOI":"10.1007\/BF03037089"},{"key":"30_CR12","unstructured":"S. Muggleton and C. Feng, Efficient induction of logic programs, Inductive Logic Programming, 1992."},{"key":"30_CR13","unstructured":"S.H. Nienhuys-Cheng and R.D. Wolf, The subsumption theorem in inductive logic programming: facts and fallacies, International Workshop on Inductive Logic Programming, Leuven, 1995."},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0004-3702(92)90075-9","volume":"53","author":"L. Raedt De","year":"1992","unstructured":"L. De Raedt and M. Bruynooghe, Belief updating from integrity constraints and queries, Artificial Intelligence, vol 53, pp. 291\u2013307, 1992.","journal-title":"Artificial Intelligence"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0004-3702(97)00041-6","volume":"95","author":"L. Raedt De","year":"1997","unstructured":"L. De Raedt, Logical settings for concept-learning, Artificial Intelligence, 95 187\u2013201 (1997).","journal-title":"Artificial Intelligence"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1007361123060","volume":"26","author":"L. Raedt De","year":"1997","unstructured":"L. De Raedt and L. Dehaspe, Clausal Discovery, Machine Learning, 26, 99\u2013146 (1997).","journal-title":"Machine Learning"},{"issue":"1\u20132","key":"30_CR17","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"R. Reiter, A logic for default reasoning, Artificial Intelligence, vol. 13, n\u00b0 1\u20132, pp. 81\u2013131, 1980.","journal-title":"Artificial Intelligence"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"M. Sebag, A constraint-based induction algorithm in FOL, Machine Learning, pp. 275\u2013283, 1994.","DOI":"10.1016\/B978-1-55860-335-6.50041-6"},{"key":"30_CR19","unstructured":"M. Sebag and C. Rouveirol, Induction of maximally general clauses consistent with integrity constraints, Inductive logic programming, 1994."},{"key":"30_CR20","unstructured":"M. Sebag and C. Rouveirol, Constraint inductive logic programming, Advances in inductive logic programming, 1995."},{"key":"30_CR21","unstructured":"M. Sebag, C. Rouveirol and J.F. Puget, Inductive Logic Programming + Stochastic Bias = Polynomial Approximate Learning, Multi Strategy Learning, J. Wrete & R.S. Michalski, MIT Press, 1996."},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0167-8655(94)00095-K","volume":"16","author":"H. Soldano","year":"1995","unstructured":"H. Soldano, A. Viari and M. Champesme, Searching for flexible repeated patterns using a non transitive similarity relation, Pattern Recognition Letters, vol 16, pp. 233\u2013245, 1995.","journal-title":"Pattern Recognition Letters"},{"key":"30_CR23","unstructured":"F. Torre and C. 23. F. Op\u00e9rateurs naturels en programmation logique inductive, JICAA' 97, Roscoff 20\u201322 Mai 1997, pp. 53\u201364, 1997."},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"F. Torre and C. Rouveirol, Natural ideal operators in inductive logic programming, Proceeding of the ninth European Conference on Machine Learning pp. 274\u2013289, Springer-Verlag, 1997.","DOI":"10.1007\/3-540-62858-4_92"},{"key":"30_CR25","unstructured":"P.H. Winston, Learning structural descriptions from examples, The psychology of computer vision, P.H. Winston, MacGraw-Hill, 1975."},{"key":"30_CR26","unstructured":"S. Wrobel, First order theory refinement, Advances in inductive logic programming, L. De Raedt, IOS press, 1996."}],"container-title":["Lecture Notes in Computer Science","Machine Learning: ECML-98"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026694","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:03:11Z","timestamp":1558270991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026694"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540644170","9783540697817"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/bfb0026694","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"16 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}