{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T20:29:15Z","timestamp":1648931355110},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5768,"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":[[1997,10]]},"DOI":"10.1016\/s0304-3975(97)00020-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"177-190","source":"Crossref","is-referenced-by-count":0,"title":["Learning orthogonal F-Horn formulas"],"prefix":"10.1016","volume":"185","author":[{"given":"Eiji","family":"Takimoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Miyashiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akira","family":"Maruoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshifumi","family":"Sakai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00020-0_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\/S0304-3975(97)00020-0_BIB2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF00992675","article-title":"Learning conjunctions of Horn clauses","volume":"9","author":"Angluin","year":"1992","journal-title":"Machine Learning"},{"key":"10.1016\/S0304-3975(97)00020-0_BIB3","series-title":"Proc. 23rd Annual ACM Symp. on Theory of Computing","first-page":"444","article-title":"When won't membership queries help?","author":"Angluin","year":"1991"},{"key":"10.1016\/S0304-3975(97)00020-0_BIB4","series-title":"Proc. 24th Annual ACM Symp. on Theory of Computing","first-page":"382","article-title":"Fast learning of k-term DNF formulas with queries","author":"Blum","year":"1992"},{"key":"10.1016\/S0304-3975(97)00020-0_BIB5","series-title":"Proc. 34th Annual IEEE Symp. on Foundations of Computer Science","first-page":"302","article-title":"Exact learning via the monotone theory","author":"Bshouty","year":"1993"},{"key":"10.1016\/S0304-3975(97)00020-0_BIB6","series-title":"Proc. 35th Annual IEEE Symp. on Foundations of Computer Science","first-page":"42","article-title":"An efficient membership-query algorithm for learning DNF with respect to the uniform distribution","author":"Jackson","year":"1994"},{"key":"10.1016\/S0304-3975(97)00020-0_BIB7","series-title":"Proc. 19th Annual ACM Symp. on Theory of Computing","first-page":"285","article-title":"On the learnability of Boolean formulae","author":"Kearns","year":"1987"},{"key":"10.1016\/S0304-3975(97)00020-0_BIB8","series-title":"Proc. 25th Annual ACM Symp. on Theory of Computing","first-page":"372","article-title":"Cryptographic hardness of distribution-specific learning","author":"Kharitonov","year":"1993"},{"key":"10.1016\/S0304-3975(97)00020-0_BIB9","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. System Sci."},{"issue":"11","key":"10.1016\/S0304-3975(97)00020-0_BIB10","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"},{"key":"10.1016\/S0304-3975(97)00020-0_BIB11","first-page":"560","article-title":"Learning disjunctions of conjunctions","volume":"vol. 1","author":"Valiant","year":"1985"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000200?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000200?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:59:09Z","timestamp":1555405149000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0304397597000200"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00020-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}