{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:41:46Z","timestamp":1747546906230},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3978,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00400-5","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T20:38:10Z","timestamp":1034368690000},"page":"197-215","source":"Crossref","is-referenced-by-count":8,"title":["The consistency dimension and distribution-dependent learning from queries"],"prefix":"10.1016","volume":"288","author":[{"given":"Jos\u00e9 L.","family":"Balc\u00e1zar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"Castro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Guijarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-Ulrich","family":"Simon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00400-5_BIB1","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":"75","author":"Angluin","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(01)00400-5_BIB2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00116828","article-title":"Queries and concept learning","volume":"2","author":"Angluin","year":"1988","journal-title":"Mach. Learning"},{"key":"10.1016\/S0304-3975(01)00400-5_BIB3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF00116034","article-title":"Negative results for equivalence queries","volume":"5","author":"Angluin","year":"1990","journal-title":"Mach. Learning"},{"key":"10.1016\/S0304-3975(01)00400-5_BIB4","series-title":"Sixth International Workshop, ALT\u201995, Fukuoka, Japan, Lecture Notes in Artificial Intelligence","first-page":"239","article-title":"Simple pac learning of simple decision lists","author":"Castro","year":"1995"},{"key":"10.1016\/S0304-3975(01)00400-5_BIB5","series-title":"EUROCOLT\u201993, Lecture Notes in Artificial Intelligence","first-page":"193","article-title":"On the power of equivalence queries","author":"Gavald\u00e0","year":"1993"},{"key":"10.1016\/S0304-3975(01)00400-5_BIB6","series-title":"First International Conference, DS\u201998, Fukuoka, Japan, Lecture Notes in Artificial Intelligence","first-page":"84","article-title":"Uniform characterization of polynomial-query learnabilities","author":"Hayashi","year":"1998"},{"issue":"5","key":"10.1016\/S0304-3975(01)00400-5_BIB7","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1145\/234752.234755","article-title":"How many queries are needed to learn?","volume":"43","author":"Hellerstein","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(01)00400-5_BIB8","series-title":"Proc. Fourth Annual Workshop on Computer Learning Theory, San Mateo, CA","first-page":"167","article-title":"On-line learning with an oblivious environment and the power of randomization","author":"Maass","year":"1991"},{"key":"10.1016\/S0304-3975(01)00400-5_BIB9","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"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501004005?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501004005?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T05:20:37Z","timestamp":1556860837000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501004005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501004005"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00400-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}