{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T18:30:11Z","timestamp":1764700211208,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428756"},{"type":"electronic","value":"9783540455837"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-45583-3_3","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:37:04Z","timestamp":1192783024000},"page":"12-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Queries Revisited"],"prefix":"10.1007","author":[{"given":"Dana","family":"Angluin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"3_CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"D. Angluin. Queries and concept learning. Machine Learning, 2:319\u2013342, 1988.","journal-title":"Machine Learning"},{"key":"3_CR2","first-page":"121","volume":"5","author":"D. Angluin","year":"1990","unstructured":"D. Angluin. Negative results for equivalence queries. Machine Learning, 5:121\u2013150, 1990.","journal-title":"Machine Learning"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"E. M. Arkin, H. Meijer, J. S. B. Mitchell, D. Rappaport, and S. S. Skiena. Decision trees for geometric models. In Proceedings of the Ninth Annual Symposium on Computational Geometry, pages 369\u2013378, San Diego, CA, 1993. ACM Press.","DOI":"10.1145\/160985.161167"},{"key":"3_CR4","unstructured":"J. L. Balc\u00e1zar, J. Castro, and D. Guijarro. Abstract combinatorial characterizations of exact learning via queries. In Proceedings of the 13th Annual Conference on Computational Learning Theory, pages 248\u2013254. Morgan Kaufmann, San Francisco, 2000."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"J. L. Balc\u00e1zar, J. Castro, and D. Guijarro. A general dimension for exact learning. In Proceedings of the 14th Annual Conference on Computational Learning Theory, 2001.","DOI":"10.1007\/3-540-44581-1_23"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"J. L. Balc\u00e1zar, J. Castro, D. Guijarro, and H.-U. Simon. The consistency dimension and distribution-dependent learning from queries. In Proceedings of the 10th International Conference on Algorithic Learning Theory-ALT\u2019 99, volume 1720 of LNAI, pages 77\u201392. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-46769-6_7"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. J. ACM, 36:929\u2013965, 1989.","journal-title":"J. ACM"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0890-5401(89)90002-3","volume":"82","author":"A. Ehrenfeucht","year":"1989","unstructured":"A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant. A general lower bound on the number of examples needed for learning. Inform. Comput., 82:247\u2013261, 1989.","journal-title":"Inform. Comput."},{"key":"3_CR9","unstructured":"R. Gavald\u00e0. On the power of equivalence queries. In EUROCOLT: European Conference on Computational Learning Theory, pages 193\u2013203. Clarendon Press, 1993."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/jcss.1995.1003","volume":"50","author":"S. A. Goldman","year":"1995","unstructured":"S. A. Goldman and M. J. Kearns. On the complexity of teaching. J. of Comput. Syst. Sci., 50:20\u201331, 1995.","journal-title":"J. of Comput. Syst. Sci."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Y. Hayashi, S. Matsumoto, A. Shinohara, and M. Takeda. Uniform characterizations of polynomial-query learnabilities. In Proceedings of the 1st International Conference on Discovery Science (DS-98), volume 1532of LNAI, pages 84\u201392, 1998.","DOI":"10.1007\/3-540-49292-5_8"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"T. Heged\u00fcs. Generalized teaching dimensions and the query complexity of learning. In Proceedings of the 8th Annual Conference on Computational Learning Theory, pages 108\u2013117. ACM Press, New York, NY, 1995.","DOI":"10.1145\/225298.225311"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"L. Hellerstein, K. Pillaipakkamnatt, V. Raghavan, and D. Wilkins. How many queries are needed to learn? In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 190\u2013199, 1995.","DOI":"10.1145\/225058.225114"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"R. Hyafil","year":"1976","unstructured":"R. Hyafil and R. L. Rivest. Constructing optimal binary trees is NP-complete. Information Processing Letters, 5:15\u201317, 1976.","journal-title":"Information Processing Letters"},{"key":"3_CR15","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"N. Littlestone. Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm. Machine Learning, 2:285\u2013318, 1988.","journal-title":"Machine Learning"},{"key":"3_CR16","first-page":"107","volume":"9","author":"W. Maass","year":"1992","unstructured":"W. Maass and G. Tur\u00e1n. Lower bound methods and separation results for on-line learning models. Machine Learning, 9:107\u2013145, 1992.","journal-title":"Machine Learning"},{"key":"3_CR17","unstructured":"M. Moshkov. Test theory and problems of machine learning. In Proceedings of the International School-Seminar on Discrete Mathematics and Mathematical Cybernetics, pages 6\u201310. MAX Press, Moscow, 2001."},{"issue":"4","key":"3_CR18","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF03037091","volume":"8","author":"A. Shinohara","year":"1991","unstructured":"A. Shinohara and S. Miyano. Teachability in computational learning. New Generation Computing, 8(4):337\u2013348, 1991.","journal-title":"New Generation Computing"},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"L. G. Valiant. A theory of the learnable. Commun. ACM, 27:1134\u20131142, 1984.","journal-title":"Commun. ACM"}],"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-45583-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T21:18:18Z","timestamp":1585603098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45583-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428756","9783540455837"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-45583-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"31 October 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}