{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:51:04Z","timestamp":1781077864677,"version":"3.54.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1988,4,1]],"date-time":"1988-04-01T00:00:00Z","timestamp":575856000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[1988,4]]},"DOI":"10.1007\/bf00116828","type":"journal-article","created":{"date-parts":[[2004,10,31]],"date-time":"2004-10-31T02:00:05Z","timestamp":1099188005000},"page":"319-342","source":"Crossref","is-referenced-by-count":560,"title":["Queries and concept learning"],"prefix":"10.1007","volume":"2","author":[{"given":"Dana","family":"Angluin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin, D. (1980). Finding patterns common to a set of strings. Journal of Computer and System Sciences, 21, 46?62.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR2","series-title":"Technical Report YALEU\/DCS\/RR-479","volume-title":"Types of queries for concept learning","author":"D. Angluin","year":"1986","unstructured":"Angluin, D. (1986). Types of queries for concept learning (Technical Report YALEU\/DCS\/RR-479). New Haven, CT: Yale University, Department of Computer Science."},{"key":"CR3","series-title":"Technical Report YALEU\/DCS\/RR-557","volume-title":"Learning k-bounded context-free grammars","author":"D. Angluin","year":"1987","unstructured":"Angluin, D. (1987a). Learning k-bounded context-free grammars (Technical Report YALEU\/DCS\/RR-557). New Haven. CT: Yale University, Department of Computer Science."},{"key":"CR4","series-title":"Technical Report YALEU\/DCS\/RR-559","volume-title":"Learning k-term DNF formulas using queries and counterexamples","author":"D. Angluin","year":"1987","unstructured":"Angluin, D. (1987b). Learning k-term DNF formulas using queries and counterexamples (Technical Report YALEU\/DCS\/RR-559). New Haven, CT: Yale University, Department of Computer Science."},{"key":"CR5","series-title":"Technical Report YALEU\/DCS\/RR-590","volume-title":"Learning propositional Horn sentences with hints","author":"D. Angluin","year":"1987","unstructured":"Angluin, D. (1987c). Learning propositional Horn sentences with hints (Technical Report YALEU\/DCS\/RR-590). New Haven, CT: Yale University, Department of Computer Science."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D. (1987d). Learning regular sets from queries and counterexamples. Information and Computation, 75, 87?106.","journal-title":"Information and Computation"},{"key":"CR7","first-page":"343","volume":"2","author":"D. Angluin","year":"1987","unstructured":"Angluin, D., & Laird, P. (1987). Learning from noisy examples. Machine Learning, 2, 343?370.","journal-title":"Machine Learning"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D. Angluin","year":"1983","unstructured":"Angluin, D., & Smith, C. (1983). Inductive inference: Theory and methods. Computing Surveys 15, 237?269.","journal-title":"Computing Surveys"},{"key":"CR9","first-page":"1224","volume":"13","author":"J. M. Barzdin","year":"1972","unstructured":"Barzdin, J. M., & Freivald, R. V. (1972). On the prediction of general recursive functions. Soviet Mathematics Doklady, 13, 1224?1228.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR10","first-page":"61","volume-title":"Proceedings of the Twenty-Eighth IEEE Symposium on Foundations of Computer Science","author":"P. Berman","year":"1987","unstructured":"Berman, P., & Roos, R. (1987). Learning one-counter languages in polynomial time. Proceedings of the Twenty-Eighth IEEE Symposium on Foundations of Computer Science (pp. 61?67). New York: The Institute of Electrical and Electronics Engineers."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/12130.12158","volume-title":"Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing","author":"A. Blumer","year":"1986","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. (1986). Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension. Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing (pp. 273?282). Berkeley, CA: The Association for Computing Machinery."},{"key":"CR12","series-title":"Technical Report UCSC-CRL-87-20","volume-title":"Learnability and the Vapnik-Chervonenkis dimension","author":"A. Blumer","year":"1987","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. (1987). Learnability and the Vapnik-Chervonenkis dimension (Technical Report UCSC-CRL-87?20). Santa Cruz: University of California, Computer Research Laboratory."},{"key":"CR13","first-page":"485","volume-title":"Proceedings of the Fifth National Conference on Artificial Intelligence","author":"D. Haussler","year":"1986","unstructured":"Haussler, D. (1986). Quantifying the inductive bias in concept learning. Proceedings of the Fifth National Conference on Artificial Intelligence (pp. 485?489). Philadelphia, PA: Morgan Kaufmann."},{"key":"CR14","doi-asserted-by":"crossref","unstructured":"Haussler, D. (in press). Quantifying the inductive bias: AI learning algorithms and Valiant's framework. Artificial Intelligence.","DOI":"10.1016\/0004-3702(88)90002-1"},{"key":"CR15","series-title":"Technical Report TR-03-87","volume-title":"Learning in the presence of malicious errors","author":"M. Kearns","year":"1987","unstructured":"Kearns, M., & Li, M. (1987). Learning in the presence of malicious errors (Technical Report TR-03?87). Cambridge, MA: Harvard University, Center for Research in Computing Technology."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1145\/28395.28426","volume-title":"Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing","author":"M. Kearns","year":"1987","unstructured":"Kearns, M., Li, M., Pitt, L., & Valiant, L. (1987). On the learnability of Boolean formulae. Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (pp. 285?295). New York: The Association for Computing Machinery."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0019-9958(76)80003-4","volume":"31","author":"B. Knobe","year":"1976","unstructured":"Knobe, B., & Knobe, K. (1976). A method for inferring context-free grammars. Information and Control, 31, 129?146.","journal-title":"Information and Control"},{"key":"CR18","unstructured":"Laird, P. (1987). Learning from good data and bad. Doctoral dissertation, Department of Computer Science, Yale University, New Haven, CT."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/S0019-9958(78)90849-5","volume":"39","author":"L. Levy","year":"1978","unstructured":"Levy, L., & Joshi, A. (1978). Skeletal structural descriptions. Information and control, 39, 192?211.","journal-title":"Information and control"},{"key":"CR20","first-page":"285","volume":"2","author":"N. Littlestone","year":"1987","unstructured":"Littlestone, N. (1987). Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2, 285?318.","journal-title":"Machine Learning"},{"key":"CR21","series-title":"Technical Report TR-05-86","volume-title":"Computational limitations on learning from examples","author":"L. Pitt","year":"1986","unstructured":"Pitt, L., & Valiant, L. (1986). Computational limitations on learning from examples (Technical Report TR-05?86). Cambridge, MA: Harvard University, Center for Research in Computing Technology."},{"key":"CR22","series-title":"Technical Report","volume-title":"Inductive inference of logic programs based on algebraic semantics","author":"Y. Sakakibara","year":"1987","unstructured":"Sakakibara, Y. (1987a). Inductive inference of logic programs based on algebraic semantics (Technical Report No. 79). Numazu, Japan: Fujitsu Limited, International Institute for Advanced Study of Social Information Science."},{"key":"CR23","series-title":"Technical Report","volume-title":"Inferring parsers of context-free languages from structural examples","author":"Y. Sakakibara","year":"1987","unstructured":"Sakakibara, Y. (1987b). Inferring parsers of context-free languages from structural examples. (Technical Report No. 81). Numazu, Japan: Fujitsu Limited, International Institute for Advanced Study of Social Information Science."},{"key":"CR24","volume-title":"Machine learning: An artificial intelligence approach","author":"C. Sammut","year":"1986","unstructured":"Sammut, C. & Banerji, R. (1986). Learning concepts by asking questions. In R. S., Michalski, J. G., Carbonell, & T. M., Mitchell (Eds.), Machine learning: An artificial intelligence approach (Vol. 2). Los Altos, CA: Morgan Kaufmann."},{"key":"CR25","first-page":"446","volume-title":"Proceedings of the Seventh International Joint Conference on Artificial Intelligence","author":"E. Shapiro","year":"1981","unstructured":"Shapiro, E. (1981). A general incremental algorithm that infers theories from facts. Proceedings of the Seventh International Joint Conference on Artificial Intelligence (pp. 446?451). Vancouver, B.C., Canada: Morgan Kaufman."},{"key":"CR26","first-page":"299","volume-title":"Proceedings of the Ninth ACM Symposium on Principles of Programming Languages","author":"E. Shapiro","year":"1982","unstructured":"Shapiro, E. (1982). Algorithmic program diagnosis. Proceedings of the Ninth ACM Symposium on Principles of Programming Languages (pp. 299?308). Albuquerque, NM: The Association for Computing Machinery."},{"key":"CR27","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1192.001.0001","volume-title":"Algorithmic program debugging","author":"E. Shapiro","year":"1983","unstructured":"Shapiro, E. (1983). Algorithmic program debugging. Cambridge, MA: MIT Press."},{"key":"CR28","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27, 1134?1142.","journal-title":"Communications of the ACM"},{"key":"CR29","first-page":"560","volume-title":"Proceedings of the Ninth International Joint Conference on Artificial Intelligence","author":"L. G. Valiant","year":"1985","unstructured":"Valiant, L. G. (1985). Learning disjunctions of conjunctions. Proceedings of the Ninth International Joint Conference on Artificial Intelligence (pp. 560?566). Los Angeles, CA: Morgan Kaufmann."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00116828.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00116828\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00116828","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,19]],"date-time":"2024-12-19T09:34:27Z","timestamp":1734600867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00116828"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,4]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,4]]}},"alternative-id":["BF00116828"],"URL":"https:\/\/doi.org\/10.1007\/bf00116828","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988,4]]}}}