{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:14:21Z","timestamp":1649074461662},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1016\/s0020-0190(99)00161-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:19:59Z","timestamp":1027617599000},"page":"11-16","source":"Crossref","is-referenced-by-count":3,"title":["PACS, simple-PAC and query learning"],"prefix":"10.1016","volume":"73","author":[{"given":"Jorge","family":"Castro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Guijarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(99)00161-1_ID003","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","article-title":"Learning regular sets from queries and counterexamples","volume":"Vol. 75","author":"Angluin","year":"1987","journal-title":"Inform. and Comput."},{"issue":"4","key":"10.1016\/S0020-0190(99)00161-1_ID004","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00116828","article-title":"Queries and concept learning","volume":"Vol. 2","author":"Angluin","year":"1988","journal-title":"Machine Learning"},{"key":"10.1016\/S0020-0190(99)00161-1_ID005","series-title":"Proc. 6th International Workshop on Algorithmic Learning Theory","first-page":"239","article-title":"Simple-PAC learning of simple decision lists","volume":"Vol. 997","author":"Castro","year":"1995"},{"key":"10.1016\/S0020-0190(99)00161-1_ID006","series-title":"Proc. 8th International Workshop on Algorithmic Learning Theory","first-page":"132","article-title":"PAC learning under helpful distributions","volume":"Vol. 1316","author":"Denis","year":"1997"},{"key":"10.1016\/S0020-0190(99)00161-1_ID007","series-title":"Proc. 13th Annual Symposium on the Theoretical Aspects of Computer Science","first-page":"231","article-title":"PAC learning with simple examples","volume":"Vol. 1046","author":"Denis","year":"1996"},{"issue":"2","key":"10.1016\/S0020-0190(99)00161-1_ID008","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1006\/jcss.1996.0020","article-title":"Teaching a smarter learner","volume":"Vol. 52","author":"Goldman","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(99)00161-1_ID009","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1006\/jcss.1997.1533","article-title":"An efficient membership-query algorithm for learning DNF with respect to the uniform distribution","volume":"Vol. 55","author":"Jackson","year":"1997","journal-title":"J. Comput. System Sci."},{"issue":"6","key":"10.1016\/S0020-0190(99)00161-1_ID010","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1145\/195613.195656","article-title":"Learning Boolean formulae","volume":"Vol. 41","author":"Kearns","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(99)00161-1_ID011","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1137\/0220056","article-title":"Learning simple concepts under simple distributions","volume":"Vol. 20","author":"Li","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(99)00161-1_ID012","series-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","year":"1993"},{"key":"10.1016\/S0020-0190(99)00161-1_ID013","series-title":"Proc. 8th International Workshop on Algorithmic Learning Theory","first-page":"116","article-title":"Learning dfa from simple examples","volume":"Vol. 1316","author":"Parekh","year":"1997"},{"key":"10.1016\/S0020-0190(99)00161-1_ID014","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/48014.63140","article-title":"Computational limitations on learning from examples","volume":"Vol. 35","author":"Pitt","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(99)00161-1_ID015","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"Vol. 27","author":"Valiant","year":"1984","journal-title":"Comm. ACM"},{"key":"10.1016\/S0020-0190(99)00161-1_ID016","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01578843","article-title":"A framework for polynomial time query learnability","volume":"Vol. 27","author":"Watanabe","year":"1992","journal-title":"Math. Systems Theory"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099001611?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019099001611?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T02:21:42Z","timestamp":1556158902000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019099001611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S0020019099001611"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(99)00161-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}