{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T10:02:43Z","timestamp":1786788163247,"version":"3.56.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":[[1996,7]]},"DOI":"10.1016\/0020-0190(96)00077-4","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"37-39","source":"Crossref","is-referenced-by-count":21,"title":["A subexponential exact learning algorithm for DNF using equivalence queries"],"prefix":"10.1016","volume":"59","author":[{"given":"Nader H.","family":"Bshouty","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00077-4_BIB1","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":"Machine Learning"},{"key":"10.1016\/0020-0190(96)00077-4_BIB2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(92)90237-P","article-title":"Rank-r decision trees are a subclass of r-decision lists","volume":"43","author":"Blum","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(96)00077-4_BIB3","series-title":"Proc. 7th Ann. ACM Workshop on Comput. Learning Theory","first-page":"130","article-title":"Oracles and queries that are sufficient for exact learning","author":"Bshouty","year":"1994"},{"key":"10.1016\/0020-0190(96)00077-4_BIB4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF00116036","article-title":"Learning nested differences of intersection-closed concept classes","volume":"5","author":"Helmbold","year":"1990","journal-title":"Machine Learning"},{"key":"10.1016\/0020-0190(96)00077-4_BIB5","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF00116827","article-title":"Learning quickly when irrelevant attributes abound: A new linear threshold algorithm","volume":"2","author":"Littlestone","year":"1988","journal-title":"Machine Learning"},{"key":"10.1016\/0020-0190(96)00077-4_BIB6","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF00058680","article-title":"Learning decision lists","volume":"2","author":"Rivest","year":"1987","journal-title":"Machine Learning"},{"key":"10.1016\/0020-0190(96)00077-4_BIB7","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":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000774?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000774?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:24:05Z","timestamp":1556058245000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000774"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0020019096000774"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00077-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}