{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T02:40:54Z","timestamp":1706064054948},"reference-count":51,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"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":6476,"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":[[1995,11]]},"DOI":"10.1016\/0004-3702(94)00034-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:20:38Z","timestamp":1027635638000},"page":"1-38","source":"Crossref","is-referenced-by-count":20,"title":["Pac-learning non-recursive prolog clauses"],"prefix":"10.1016","volume":"79","author":[{"given":"William W.","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(94)00034-4_BIB1","author":"Aho","year":"1974"},{"issue":"2\/3","key":"10.1016\/0004-3702(94)00034-4_BIB2","doi-asserted-by":"crossref","DOI":"10.1023\/A:1022689015665","article-title":"Learning conjunctions of horn clauses","volume":"9","author":"Angluin","year":"1992","journal-title":"Mach. Learn."},{"key":"10.1016\/0004-3702(94)00034-4_BIB3","series-title":"Proceedings Third Annual Workshop on Computational Learning Theory","article-title":"Learning functions of k terms","author":"Blum","year":"1990"},{"key":"10.1016\/0004-3702(94)00034-4_BIB4","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","article-title":"Classifying learnable concepts with the Vapnik-Chervonenkis dimension","volume":"36","author":"Blumer","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(94)00034-4_BIB5","first-page":"758","article-title":"The complexity of finite functions","author":"Boppana","year":"1990"},{"key":"10.1016\/0004-3702(94)00034-4_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)00034-4_BIB7","series-title":"Proceedings of the Ninth International Conference on Machine Learning","article-title":"Compiling knowledge into an explicit bias","author":"Cohen","year":"1992"},{"key":"10.1016\/0004-3702(94)00034-4_BIB8","series-title":"Proceedings Tenth National Conference on Artificial Intelligence","article-title":"Cryptographic limitations on learning one-clause logic programs","author":"Cohen","year":"1993"},{"key":"10.1016\/0004-3702(94)00034-4_BIB9","series-title":"Proceedings Third International Workshop on Inductive Logic Programming","article-title":"Learnability of restricted logic programs","author":"Cohen","year":"1993"},{"key":"10.1016\/0004-3702(94)00034-4_BIB10","series-title":"Proceedings Tenth National Conference on Artificial Intelligence","article-title":"A pac-learning algorithm for a restricted class of recursive logic programs","author":"Cohen","year":"1993"},{"key":"10.1016\/0004-3702(94)00034-4_BIB11","series-title":"Proceedings 1993 IJCAI Workshop on Inductive Logic Programming","article-title":"Rapid prototyping of ILP systems using explicit bias","author":"Cohen","year":"1993"},{"key":"10.1016\/0004-3702(94)00034-4_BIB12","series-title":"Proceedings Eleventh National Conference on Artificial Intelligence","article-title":"Pac-learning nondeterminate clauses","author":"Cohen","year":"1994"},{"key":"10.1016\/0004-3702(94)00034-4_BIB13","doi-asserted-by":"crossref","unstructured":"W.W. Cohen, Pac-learning recursive logic programs: efficient algorithms, J. Artif. Intell. Res.2, 500\u2013539.","DOI":"10.1613\/jair.97"},{"key":"10.1016\/0004-3702(94)00034-4_BIB14","doi-asserted-by":"crossref","unstructured":"W.W. Cohen, Pac-learning recursive logic programs: negative results, J. Artif. Intell. Res.2, 541\u2013573.","DOI":"10.1613\/jair.1917"},{"key":"10.1016\/0004-3702(94)00034-4_BIB15","series-title":"Proceedings Fourth Annual Workshop on Computational Learning Theory","article-title":"Learnability of description logics","author":"Cohen","year":"1992"},{"key":"10.1016\/0004-3702(94)00034-4_BIB16","series-title":"Proceedings 1992 Workshop on Computational Learning Theory","article-title":"Pac-learnability of determinate logic programs","author":"Dz\u0306eroski","year":"1992"},{"key":"10.1016\/0004-3702(94)00034-4_BIB17","series-title":"Inductive Logic Programming","article-title":"Inducing temporal fault diagnosic rules from a qualitative model","author":"Feng","year":"1992"},{"key":"10.1016\/0004-3702(94)00034-4_BIB18","series-title":"Proceedings Fourth Annual Workshop on Computational Learning Theory","article-title":"Learning DNF formulae under classes of probability distributions","author":"Flammini","year":"1992"},{"key":"10.1016\/0004-3702(94)00034-4_BIB19","series-title":"Proceedings Third International Workshop on Inductive Logic Programming","article-title":"Learnability of recursive, non-determinate theories: Some basic results and techniques","author":"Frazier","year":"1993"},{"key":"10.1016\/0004-3702(94)00034-4_BIB20","series-title":"Proceedings Tenth International Conference on Machine Learning","article-title":"Learning from entailment: An application to propositional horn sentences","author":"Frazier","year":"1993"},{"key":"10.1016\/0004-3702(94)00034-4_BIB21","series-title":"Proceedings Eighth International Workshop on Machine Learning","article-title":"Learning constrained atoms","author":"Frisch","year":"1991"},{"key":"10.1016\/0004-3702(94)00034-4_BIB22","series-title":"Proceedings Sixth Annual ACM Conference on Computational Learning Theory","article-title":"Learning k\u03bc decision trees on the uniform distribution","author":"Hancock","year":"1993"},{"issue":"1","key":"10.1016\/0004-3702(94)00034-4_BIB23","doi-asserted-by":"crossref","DOI":"10.1007\/BF00114802","article-title":"Learning conjunctive concepts in structural domains","volume":"4","author":"Haussler","year":"1989","journal-title":"Mach. Learn."},{"key":"10.1016\/0004-3702(94)00034-4_BIB24","series-title":"Proceedings 19th ACM Symposium on Theory of Computing","article-title":"On the learnability of boolean formulae","author":"Kearns","year":"1987"},{"key":"10.1016\/0004-3702(94)00034-4_BIB25","series-title":"Proceedings 21th ACM Symposium on Theory of Computing","article-title":"Cryptographic limitations on learning Boolean formulae and finite automata","author":"Kearns","year":"1989"},{"key":"10.1016\/0004-3702(94)00034-4_BIB26","series-title":"Proceedings Fourth Annual Workshop on Computational Learning heory","article-title":"Cryptographic lower bounds on the learnability of boolean functions on the uniform distribution","author":"Kharitonov","year":"1992"},{"key":"10.1016\/0004-3702(94)00034-4_BIB27","series-title":"Proceedings 1993 European Conference on Machine Learning","article-title":"Some computational lower bounds for the computational complexity of inductive logic programming","author":"Kietz","year":"1993"},{"key":"10.1016\/0004-3702(94)00034-4_BIB28","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)00034-4_BIB29","series-title":"Proceedings Workshop on Evaluating and Changing Representation in Machine learning (at IJCAI-91)","article-title":"Constructive induction of background knowledge","author":"Kietz","year":"1991"},{"key":"10.1016\/0004-3702(94)00034-4_BIB30","article-title":"Drug design by machine learning: the use of inductive logic programming to model the structure-activity relationships of trimethoprim analogues binding to dihydrofolate reductase","volume":"89","author":"King","year":"1992"},{"key":"10.1016\/0004-3702(94)00034-4_BIB31","series-title":"Proceedings Sixth Annual ACM Conference on Computational learning Theory","article-title":"On learning visual concepts and DNF formulae","author":"Kushilevitz","year":"1993"},{"key":"10.1016\/0004-3702(94)00034-4_BIB32","series-title":"Analogical and Inductive Inference: International Workshop AII'92","article-title":"Background knowledge and declarative bias in inductive concept learning","volume":"642","author":"Lavrac\u0306","year":"1992"},{"issue":"5","key":"10.1016\/0004-3702(94)00034-4_BIB33","doi-asserted-by":"crossref","DOI":"10.1137\/0220056","article-title":"Learning simple concepts under simple distributions","volume":"20","author":"Li","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0004-3702(94)00034-4_BIB34","author":"Lloyd","year":"1987"},{"key":"10.1016\/0004-3702(94)00034-4_BIB35","series-title":"Inductive Logic Programming","article-title":"The application of inductive logic programming to finite-element mesh design","author":"Muggleton","year":"1992"},{"key":"10.1016\/0004-3702(94)00034-4_BIB36","series-title":"Inductive Logic Programming","article-title":"Inductive logic programming","author":"Muggleton","year":"1992"},{"key":"10.1016\/0004-3702(94)00034-4_BIB37","series-title":"Inductive Logic Programming","article-title":"Efficient induction of logic programs","author":"Muggleton","year":"1992"},{"key":"10.1016\/0004-3702(94)00034-4_BIB38","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1093\/protein\/5.7.647","article-title":"Protein secondary structure prediction using logic-based machine learning","volume":"5","author":"Muggleton","year":"1992","journal-title":"Protein Engrg."},{"key":"10.1016\/0004-3702(94)00034-4_BIB39","series-title":"Inductive Logic Programming","year":"1992"},{"issue":"1","key":"10.1016\/0004-3702(94)00034-4_BIB40","doi-asserted-by":"crossref","DOI":"10.1007\/BF00993254","article-title":"The utility of knowledge in inductive learning","volume":"9","author":"Pazzani","year":"1992","journal-title":"Mach. Learn."},{"key":"10.1016\/0004-3702(94)00034-4_BIB41","series-title":"Proceedings Seventh Annual ACM Conference on Computational Learning Theory","article-title":"Classic learning","author":"Pitt","year":"1994"},{"key":"10.1016\/0004-3702(94)00034-4_BIB42","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\/0004-3702(94)00034-4_BIB43","series-title":"Proceedings 3rd Annual IEEE Conference on Structure in Complexity Theory","article-title":"Reductions among prediction problems: On the difficulty of predicting automata","author":"Pitt","year":"1988"},{"key":"10.1016\/0004-3702(94)00034-4_BIB44","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. Syst. Sci."},{"key":"10.1016\/0004-3702(94)00034-4_BIB45","first-page":"153","article-title":"A note on inductive generalization","volume":"5","author":"Plotkin","year":"1969","journal-title":"Mach. Intell."},{"issue":"3","key":"10.1016\/0004-3702(94)00034-4_BIB46","doi-asserted-by":"crossref","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)00034-4_BIB47","series-title":"Proceedings Eighth International Workshop on Machine Learning","article-title":"Determinate literals in inductive logic programming","author":"Quinlan","year":"1991"},{"issue":"2","key":"10.1016\/0004-3702(94)00034-4_BIB48","doi-asserted-by":"crossref","DOI":"10.1007\/BF00116037","article-title":"The strength of weak learnability","volume":"5","author":"Schapire","year":"1990","journal-title":"Mach. Learn."},{"key":"10.1016\/0004-3702(94)00034-4_BIB49","author":"Shapiro","year":"1982"},{"issue":"11","key":"10.1016\/0004-3702(94)00034-4_BIB50","doi-asserted-by":"crossref","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Commun. ACM"},{"key":"10.1016\/0004-3702(94)00034-4_BIB51","series-title":"Proceedings Eighth Nutionul Conference on Artificial Intelligence","article-title":"On analytical and similarity-based classification","author":"Vilain","year":"1990"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370294000344?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370294000344?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T21:31:52Z","timestamp":1580851912000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370294000344"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":51,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["0004370294000344"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(94)00034-4","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}