{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T08:44:32Z","timestamp":1648543472482},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,7,1]],"date-time":"1998-07-01T00:00:00Z","timestamp":899251200000},"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":[[1998,7]]},"DOI":"10.1016\/s0020-0190(98)00090-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"75-79","source":"Crossref","is-referenced-by-count":3,"title":["Learning nearly monotone k-term DNF"],"prefix":"10.1016","volume":"67","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"}]},{"given":"V\u00edctor","family":"Lav\u00edn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00090-8_BIB1","article-title":"Learning k-term DNF formulas using queries and counter-examples","author":"Angluin","year":"1987"},{"key":"10.1016\/S0020-0190(98)00090-8_BIB2","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."},{"issue":"4","key":"10.1016\/S0020-0190(98)00090-8_BIB3","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\/S0020-0190(98)00090-8_BIB4","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00116034","article-title":"Negative results for equivalence queries","volume":"5","author":"Angluin","year":"1990","journal-title":"Mach. Learning"},{"key":"10.1016\/S0020-0190(98)00090-8_BIB5","series-title":"Proc. 6th Annual Workshop on Comput. Learning Theory","first-page":"37","article-title":"Linear time deterministic learning of k-term DNF","author":"Berggren","year":"1993"},{"key":"10.1016\/S0020-0190(98)00090-8_BIB6","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1006\/jcss.1995.1075","article-title":"Fast learning of k-term DNF formulas with queries","volume":"51","author":"Blum","year":"1995","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(98)00090-8_BIB7","series-title":"Proc. 8th Annual ACM Workshop on Comput. Learning Theory","first-page":"447","article-title":"Simple learning algorithms using divide and conquer","author":"Bshouty","year":"1995"},{"key":"10.1016\/S0020-0190(98)00090-8_BIB8","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1006\/jcss.1996.0032","article-title":"Oracles and queries that are sufficient for exact learning","volume":"52","author":"Bshouty","year":"1996","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0020-0190(98)00090-8_BIB9","series-title":"Proc. 6th Annual Workshop on Comput. Learning Theory","first-page":"41","article-title":"Asking queries to minimize errors","author":"Bshouty","year":"1993"},{"key":"10.1016\/S0020-0190(98)00090-8_BIB10","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1137\/0220056","article-title":"Learning simple concepts under simple distributions","volume":"20","author":"Li","year":"1991","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000908?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000908?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:28:15Z","timestamp":1556044095000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000908"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,7]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,7]]}},"alternative-id":["S0020019098000908"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00090-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,7]]}}}