{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:40:17Z","timestamp":1742600417694,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540604549"},{"type":"electronic","value":"9783540474708"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60454-5_32","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:38:52Z","timestamp":1330288732000},"page":"110-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning orthogonal F-Horn formulas"],"prefix":"10.1007","author":[{"given":"Akira","family":"Miyashiro","sequence":"first","affiliation":[]},{"given":"Eiji","family":"Takimoto","sequence":"additional","affiliation":[]},{"given":"Yoshifumi","family":"Sakai","sequence":"additional","affiliation":[]},{"given":"Akira","family":"Maruoka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"8_CR1","first-page":"147","volume":"9","author":"D. Angluin","year":"1992","unstructured":"Dana Angluin, Michael Frazier, and Leonard Pitt. Learning conjunctions of Horn clauses. Machine Learning, 9:147\u2013164, 1992.","journal-title":"Machine Learning"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Dana Angluin and Michael Kharitonov. When won't membership queries help? In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pages 444\u2013454. Association for Computing Machinery, 1991.","DOI":"10.1145\/103418.103420"},{"key":"8_CR3","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Dana Angluin. Queries and concept learning. Machine Learning, 2:319\u2013342, 1988.","journal-title":"Machine Learning"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Avrim Blum and Steven Rudich. Fast learning of k-term DNF formulas with queries. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 382\u2013389. Association for Computing Machinery, 1992.","DOI":"10.1145\/129712.129748"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Nader H. Bshouty. Exact learning via the monotone theory. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pages 302\u2013311. IEEE, 1993.","DOI":"10.1109\/SFCS.1993.366857"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Jeffrey Jackson. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, pages 42\u201353, 1994.","DOI":"10.1109\/SFCS.1994.365706"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Michael Kharitonov. Cryptographic hardness of distribution-specific learning. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 372\u2013381, 1993.","DOI":"10.1145\/167088.167197"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Michael Kearns, Ming Li, Leonard Pitt, and Leslie G. Valiant. On the learnability of Boolean formulae. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 185\u2013294. Association for Computing Machinery, 1987.","DOI":"10.1145\/28395.28426"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1016\/0022-0000(90)90028-J","volume":"41","author":"L. Pitt","year":"1990","unstructured":"Leonard Pitt and Manfred K. Warmuth. Prediction-preserving reducibility. Journal of Computer and System Sciences, 41:430\u2013467, 1990.","journal-title":"Journal of Computer and System Sciences"},{"issue":"11","key":"8_CR10","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"Leslie G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134\u20131142, 1984.","journal-title":"Communications of the ACM"},{"key":"8_CR11","first-page":"1134","volume":"1","author":"L. G. Valiant","year":"1985","unstructured":"Leslie G. Valiant. Learning disjunctions of conjunctions. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, volume 1, pages 1134\u20131142, Los Angeles, Aug. 1985.","journal-title":"Proceedings of the 9th International Joint Conference on Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60454-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:04:26Z","timestamp":1742598266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60454-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540604549","9783540474708"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-60454-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}