{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:25:48Z","timestamp":1767651948346},"reference-count":31,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":5837,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1016\/s0004-3702(97)00041-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:37:38Z","timestamp":1027625858000},"page":"187-201","source":"Crossref","is-referenced-by-count":97,"title":["Logical settings for concept-learning"],"prefix":"10.1016","volume":"95","author":[{"given":"Luc","family":"De Raedt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(97)00041-6_BIB1","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF00992675","article-title":"Learning conjunctions of horn clauses","volume":"9","author":"Angluin","year":"1992","journal-title":"Machine Learning"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB2","article-title":"Learning prepositional horn sentences with hints","author":"Angluin","year":"1987"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB3","doi-asserted-by":"crossref","DOI":"10.1007\/BF03037231","article-title":"Polynomial learnability and inductive logic programming: methods and results","volume":"13","author":"Cohen","year":"1995","journal-title":"New Generation Comput."},{"key":"10.1016\/S0004-3702(97)00041-6_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(94)00034-4","article-title":"PAC-learning non-recursive Prolog clauses","volume":"79","author":"Cohen","year":"1995","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB5","unstructured":"L. De Raedt and L. Dehaspe, Learning from satisfiability, Tech. Rept. KUL-CW, Department of Computer Science, Katholieke Universiteit Leuven, Belgium, to appear."},{"key":"10.1016\/S0004-3702(97)00041-6_BIB6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1023\/A:1007361123060","article-title":"Clausal discovery","volume":"26","author":"De Raedt","year":"1997","journal-title":"Machine Learning"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB7","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0004-3702(94)90112-0","article-title":"First-order jk-clausal theories are PAC-learnable","volume":"70","author":"De Raedt","year":"1994","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/S0004-3702(97)00041-6_BIB8","first-page":"227","article-title":"Multiple predicate learning in two inductive logic programming settings","volume":"4","author":"De Raedt","year":"1996","journal-title":"J. Interest Group in Pure and Applied Logics"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB9","series-title":"Proceedings 5th Workshop on Algorithmic Learning Theory","article-title":"Inductive constraint logic","volume":"Vol. 997","author":"De Raedt","year":"1995"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB10","series-title":"Proceedings 3rd International Workshop on Multistrategy Learning","first-page":"29","article-title":"Induction in logic","author":"De Raedt","year":"1996"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB11","series-title":"Proceedings 5th International Workshop on Inductive Logic Programming","article-title":"Are substitutions the better examples?","author":"Fensel","year":"1995"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB12","series-title":"Inductive Logic Programming","article-title":"A framework for inductive logic programming","author":"Flach","year":"1992"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB13","series-title":"Proceedings 4th International Workshop on Inductive Logic Programming","article-title":"Inductive logic programming and philosophy of science","volume":"Vol. 237","author":"Flach","year":"1994"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB14","article-title":"An inquiry concerning the logic of induction","author":"Flach","year":"1995"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB15","series-title":"Proceedings 9th International Conference on Machine Learning","article-title":"Learning from entailment","author":"Frazier","year":"1993"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB16","author":"Genesereth","year":"1987"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB17","series-title":"Proceedings 13th International Conference on Machine Learning","first-page":"207","article-title":"Exploiting the omission of irrelevant data","author":"Greiner","year":"1996"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB18","series-title":"Proceedings Joint International Workshop on Analogical and Inductive Inference and Algorithmic Learning Theory","first-page":"317","article-title":"Finding tree patterns consistent with positive and negative examples with queries","author":"Ishizaka","year":"1994"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB19","author":"Kearns","year":"1994"},{"issue":"1","key":"10.1016\/S0004-3702(97)00041-6_BIB20","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/181668.181674","article-title":"Inductive logic programming and learnability","volume":"5","author":"Kietz","year":"1994","journal-title":"SIGART Bull."},{"key":"10.1016\/S0004-3702(97)00041-6_BIB21","author":"Lloyd","year":"1987"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB22","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0004-3702(82)90040-6","article-title":"Generalization as search","volume":"18","author":"Mitchell","year":"1982","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB23","series-title":"Proceedings 2nd Workshop on Algorithmic Learning Theory","article-title":"Which classes of elementary formal systems are polynomial-time learnable?","author":"Miyano","year":"1991"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB24","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","article-title":"Inductive logic programming: theory and methods","volume":"19\u201320","author":"Muggleton","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB25","series-title":"Proceedings 1st Conference on Algorithmic Learning Theory","first-page":"368","article-title":"Efficient induction of logic programs","author":"Muggleton","year":"1990"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB26","series-title":"Proceedings 3rd Workshop on Algorithmic Learning Theory","first-page":"123","article-title":"Inductive inference machines that can refute hypothesis spaces","volume":"Vol. 744","author":"Mukouchi","year":"1993"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB27","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/48014.63140","article-title":"Computational limitations on learning from examples","volume":"35","author":"Pitt","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB28","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1016\/0022-0000(90)90028-J","article-title":"Prediction-preserving reducibility","volume":"41","author":"Pitt","year":"1990","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0004-3702(97)00041-6_BIB29","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF00117105","article-title":"Learning logical definitions from relations","volume":"5","author":"Quinlan","year":"1990","journal-title":"Machine Learning"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB30","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Comm. ACM"},{"key":"10.1016\/S0004-3702(97)00041-6_BIB31","series-title":"Proceedings Fachgruppentreffen Maschinelles Lernen","article-title":"The ILP description learning problem: towards a general model-level definition of data mining in ILP","author":"Wrobel","year":"1995"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370297000416?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370297000416?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T17:57:35Z","timestamp":1555523855000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370297000416"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["S0004370297000416"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(97)00041-6","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1997,8]]}}}