{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T13:08:52Z","timestamp":1782047332211,"version":"3.54.5"},"reference-count":27,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0004-3702(94)90112-0","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"375-392","source":"Crossref","is-referenced-by-count":102,"title":["First-order jk-clausal theories are PAC-learnable"],"prefix":"10.1016","volume":"70","author":[{"given":"Luc","family":"De Raedt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sa\u0161o","family":"D\u017eeroski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(94)90112-0_BIB1","unstructured":"H. Ad\u00e9, L. De Raedt and M. Bruynooghe, Declarative bias for bottom-up ILP systems, Mach. Learn. (submitted)."},{"key":"10.1016\/0004-3702(94)90112-0_BIB2","article-title":"Towards an inductive logic programming language","author":"Bergadano","year":"1993"},{"issue":"4","key":"10.1016\/0004-3702(94)90112-0_BIB3","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"Learnability and the Vapnik-Chervonenkis dimension","volume":"36","author":"Blumer","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(94)90112-0_BIB4","series-title":"Proceedings AAAI-93","first-page":"86","article-title":"PAC-learning a restricted class of recursive logic programs","author":"Cohen","year":"1993"},{"key":"10.1016\/0004-3702(94)90112-0_BIB5","series-title":"Proceedings Third International Workshop on Inductive Logic Programming (ILP'93)","first-page":"41","article-title":"Learnability of restricted logic programs","author":"Cohen","year":"1993"},{"issue":"2","key":"10.1016\/0004-3702(94)90112-0_BIB6","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0004-3702(94)90070-1","article-title":"Grammatically biased learning: Learning logic programs using an explicit antecedent description language","volume":"68","author":"Cohen","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)90112-0_BIB7","series-title":"Proceedings IJCAI-93","first-page":"1058","article-title":"A theory of clausal discovery","author":"De Raedt","year":"1993"},{"key":"10.1016\/0004-3702(94)90112-0_BIB8","series-title":"Proceedings Seventh International Symposium on Methodologies for Intelligent Systems","first-page":"435","article-title":"The many faces of inductive logic programming","author":"De Raedt","year":"1993"},{"key":"10.1016\/0004-3702(94)90112-0_BIB9","series-title":"Proceedings Fifth ACM Workshop on Computational Learning Theory","first-page":"128","article-title":"PAC-learnability of determinate logic programs","author":"D\u017eeroski","year":"1992"},{"key":"10.1016\/0004-3702(94)90112-0_BIB10","series-title":"Proceedings Sixth European Conference on Machine Learning","first-page":"342","article-title":"Learnability of constrained logic programs","author":"D\u017eeroski","year":"1993"},{"key":"10.1016\/0004-3702(94)90112-0_BIB11","series-title":"Inductive Logic Programming","first-page":"193","article-title":"A framework for inductive logic programming","author":"Flach","year":"1992"},{"key":"10.1016\/0004-3702(94)90112-0_BIB12","series-title":"Proceedings First International Conference on Principles of Knowledge Representation and Reasoning","first-page":"149","article-title":"Induction as nonmonotonic inference","author":"Helft","year":"1989"},{"key":"10.1016\/0004-3702(94)90112-0_BIB13","series-title":"Proceedings Sixth European Conference on Machine Learning","first-page":"115","article-title":"Some lower bounds for the computational complexity of inductive logic programming","author":"Kietz","year":"1993"},{"issue":"1","key":"10.1016\/0004-3702(94)90112-0_BIB14","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\/0004-3702(94)90112-0_BIB15","series-title":"Inductive Logic Programming","first-page":"107","article-title":"Controlling the complexity of learning through syntactic and task-oriented models","author":"Kietz","year":"1992"},{"key":"10.1016\/0004-3702(94)90112-0_BIB16","author":"Lloyd","year":"1987"},{"key":"10.1016\/0004-3702(94)90112-0_BIB17","year":"1992"},{"key":"10.1016\/0004-3702(94)90112-0_BIB18","doi-asserted-by":"crossref","unstructured":"S.H. Muggleton and L. De Raedt, Inductive logic programming: theory and methods, J. Logic Programm. (to appear).","DOI":"10.1016\/0743-1066(94)90035-3"},{"key":"10.1016\/0004-3702(94)90112-0_BIB19","series-title":"Proceedings First Conference on Algorithmic Learning Theory","first-page":"368","article-title":"Efficient induction of logic programs","author":"Muggleton","year":"1990"},{"key":"10.1016\/0004-3702(94)90112-0_BIB20","author":"Natarajan","year":"1991"},{"key":"10.1016\/0004-3702(94)90112-0_BIB21","article-title":"Anti-unification in constraint logics: foundations and applications to learnability in first-order logic, to speed-up learning and to deduction","author":"Page","year":"1993"},{"key":"10.1016\/0004-3702(94)90112-0_BIB22","series-title":"Inductive Logic Programming","article-title":"Generalization and learnability: a case study of constrained atoms","author":"Page","year":"1992"},{"issue":"3","key":"10.1016\/0004-3702(94)90112-0_BIB23","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":"Mach. Learn."},{"key":"10.1016\/0004-3702(94)90112-0_BIB24","series-title":"Inductive Logic Programming","article-title":"Extensions of inversion of resolution applied to theory completion","author":"Rouveirol","year":"1992"},{"key":"10.1016\/0004-3702(94)90112-0_BIB25","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1023\/A:1022678217288","article-title":"Flattening and saturation: two representation changes for generalization","volume":"14","author":"Rouveirol","year":"1994","journal-title":"Mach. Learn."},{"key":"10.1016\/0004-3702(94)90112-0_BIB26","author":"Shapiro","year":"1983"},{"issue":"11","key":"10.1016\/0004-3702(94)90112-0_BIB27","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":"Commun. ACM"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370294901120?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370294901120?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T00:56:44Z","timestamp":1553648204000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370294901120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0004370294901120"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(94)90112-0","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}