{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T12:10:05Z","timestamp":1752149405027,"version":"3.41.2"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1023\/a:1007421315813","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T04:48:21Z","timestamp":1040532501000},"page":"245-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Learning from Examples and Membership Queries with Structured Determinations"],"prefix":"10.1007","volume":"32","author":[{"given":"Prasad","family":"Tadepalli","sequence":"first","affiliation":[]},{"given":"Stuart","family":"Russell","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"181111_CR1","first-page":"170","volume-title":"Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science","author":"H. Aizenstein","year":"1991","unstructured":"Aizenstein, H., & Pitt, L. (1991). Exact learning of read-twice DNF formulas. In Proceedings of the 32\nnd Annual IEEE Symposium on Foundations of Computer Science, (pp. 170\u2013179). Washington, D.C.: IEEE Computer Society Press."},{"issue":"4","key":"181111_CR2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1022821128753","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D. (1988). Queries and concept learning. Machine Learning, 2(4), 319\u2013342.","journal-title":"Machine Learning"},{"issue":"1","key":"181111_CR3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/138027.138061","volume":"40","author":"D. Angluin","year":"1993","unstructured":"Angluin, D., Hellerstein, L., & Karpinski, M. (1993). Learning read-once formulas with queries. Journal of the ACM, 40(1), 185\u2013210.","journal-title":"Journal of the ACM"},{"issue":"2","key":"181111_CR4","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1006\/jcss.1995.1026","volume":"50","author":"D. Angluin","year":"1995","unstructured":"Angluin, D., & Kharitonov, M. (1995). When won't membership queries help?. Journal of Computer and Systems Sciences, 50(2), 336\u2013355.","journal-title":"Journal of Computer and Systems Sciences"},{"key":"181111_CR5","first-page":"387","volume":"17","author":"P. Baffes","year":"1993","unstructured":"Baffes, P., & Mooney, R. (1993). Extending theory refinement to m-of-n rules. Informatica, 17, 387\u2013397.","journal-title":"Informatica"},{"issue":"4","key":"181111_CR6","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A. Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. (1989). Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36(4), 929\u2013965.","journal-title":"Journal of the ACM"},{"key":"181111_CR7","first-page":"1","volume-title":"Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory","author":"N. Bshouty","year":"1992","unstructured":"Bshouty, N., Hancock, T., & Hellerstein, L. (1992). Learning Boolean read-once formulas with arbitrary symmetric and constant fan-in gates. In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, (pp. 1\u201315). Pittsburgh, PA: ACM Press."},{"issue":"3","key":"181111_CR8","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1006\/jcss.1995.1042","volume":"50","author":"N. Bshouty","year":"1995","unstructured":"Bshouty, N., Hancock, T., & Hellerstein, L. (1995). Learning Boolean read-once formulas over generalized bases. Journal of Computer and Systems Sciences, 50(3), 521\u2013542.","journal-title":"Journal of Computer and Systems Sciences"},{"issue":"4","key":"181111_CR9","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1137\/S009753979223664X","volume":"24","author":"N. Bshouty","year":"1995","unstructured":"Bshouty, N., Hancock, T., & Hellerstein, L. (1995). Learning arithmetic read-once formulas. SIAM Journal on Computing, 24(4), 706\u201335.","journal-title":"SIAM Journal on Computing"},{"key":"181111_CR10","first-page":"490","volume-title":"Proceedings of the Eighth International Workshop on Machine Learning","author":"W. Cohen","year":"1991","unstructured":"Cohen, W. (1991). The generality of overgenerality. In Proceedings of the Eighth International Workshop on Machine Learning, (pp. 490\u2013494). Evanston, IL: Morgan Kaufmann."},{"key":"181111_CR11","first-page":"102","volume-title":"Proceedings of the Ninth International Conference on Machine Learning","author":"W. Cohen","year":"1992","unstructured":"Cohen, W. (1992). Compiling prior knowledge into an explicit bias. In Proceedings of the Ninth International Conference on Machine Learning, (pp. 102\u2013110). Austin, TX: Morgan Kaufmann."},{"issue":"4","key":"181111_CR12","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1023\/A:1022649401552","volume":"9","author":"G. Cooper","year":"1992","unstructured":"Cooper, G., & Herskovits, E. (1992). A Bayesian method for the induction of probabilistic networks from data. Machine Learning, 9(4), 309\u2013348.","journal-title":"Machine Learning"},{"key":"181111_CR13","doi-asserted-by":"crossref","unstructured":"Davies, T. (1985). Analogy. Informal note IN-CSLI\u201385\u20134, CSLI, Stanford University.","DOI":"10.2139\/ssrn.2214214"},{"key":"181111_CR14","first-page":"125","volume-title":"Proceedings of International Conference on Machine Learning","author":"N. Friedman","year":"1997","unstructured":"Friedman, N. (1997). Learning belief networks in the presence of missing values and hidden variables. In Proceedings of International Conference on Machine Learning, (pp. 125\u2013133). Nashville, TN: Morgan Kaufmann."},{"key":"181111_CR15","volume-title":"The instance description: How it can be derived and the use of its derivation","author":"L. Getoor","year":"1989","unstructured":"Getoor, L. (1989). The instance description: How it can be derived and the use of its derivation. Unpublished ms report, Computer Science Division, University of California, Berkeley, CA. Later published as NASA Ames Research Center Technical Report IC\u201394\u201304."},{"key":"181111_CR16","first-page":"199","volume-title":"Proceedings of the Fourth Annual Workshop on Computational Learning Theory","author":"T. Hancock","year":"1991","unstructured":"Hancock, T. (1991). Learning 2\u03bcDNF formulas and k\u03bcdecision trees. In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, (pp. 199\u2013209). San Mateo, CA: Morgan Kaufmann."},{"key":"181111_CR17","first-page":"326","volume-title":"Proceedings of the Fourth Annual Workshop on Computational Learning Theory","author":"T. Hancock","year":"1991","unstructured":"Hancock, T., & Hellerstein, L. (1991). Learning read-once formulas over fields and extended bases. In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, (pp. 326\u2013336). Santa Cruz, CA: Morgan Kaufmann."},{"key":"181111_CR18","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/978-1-4613-1523-0_12","volume-title":"Change of Representation and Inductive Bias","author":"H. Hirsh","year":"1990","unstructured":"Hirsh, H. (1990). Knowledge as bias. In Benjamin, D. (Ed.), Change of Representation and Inductive Bias, pp. 209\u2013221. Kluwer, Norwell, MA."},{"issue":"1","key":"181111_CR19","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1145\/174644.174647","volume":"41","author":"M. Kearns","year":"1994","unstructured":"Kearns, M., & Valiant, L. (1994). Cryptographic limitations on learning Boolean formulae and finite automata. Journal of the ACM, 41(1), 67\u201395.","journal-title":"Journal of the ACM"},{"issue":"1","key":"181111_CR20","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1022687630067","volume":"13","author":"R. Kohavi","year":"1993","unstructured":"Kohavi, R., & Benson, S. (1993). Research note on decision lists. Machine Learning, 13(1), 131\u2013134.","journal-title":"Machine Learning"},{"issue":"1","key":"181111_CR21","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1023\/A:1022605018507","volume":"17","author":"S. Mahadevan","year":"1994","unstructured":"Mahadevan, S., & Tadepalli, P. (1994). Quantifying prior determination knowledge using PAC learning model. Machine Learning, 17(1), 69\u2013105.","journal-title":"Machine Learning"},{"key":"181111_CR22","first-page":"184","volume-title":"Readings in Machine Learning","author":"T. Mitchell","year":"1980","unstructured":"Mitchell, T. (1980). The need for biases in learning generalizations. In Shavlik, J., & Dietterich, T. (Eds.), Readings in Machine Learning, pp. 184\u2013191. Morgan Kaufmann, San Mateo, CA. Originally published as Rutgers University technical report."},{"key":"181111_CR23","first-page":"369","volume-title":"Proceedings of the First Conference on Algorithmic Learning Theory","author":"S. Muggleton","year":"1990","unstructured":"Muggleton, S., & Feng, C. (1990). Efficient induction of logic programs. In Proceedings of the First Conference on Algorithmic Learning Theory, (pp. 369\u2013381). Tokyo, Japan: Ohmsha."},{"key":"181111_CR24","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1022611825350","volume":"5","author":"G. Pagallo","year":"1990","unstructured":"Pagallo, G., & Haussler, D. (1990). Boolean feature discovery in empirical learning. Machine Learning, 5, 71\u201399.","journal-title":"Machine Learning"},{"issue":"1","key":"181111_CR25","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1023\/A:1022628829777","volume":"9","author":"M. Pazzani","year":"1992","unstructured":"Pazzani, M., & Kibler, D. (1992). The utility of knowledge in inductive learning. Machine Learning, 9(1), 57\u201394.","journal-title":"Machine Learning"},{"key":"181111_CR26","volume-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"J. Pearl","year":"1988","unstructured":"Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, CA."},{"issue":"2","key":"181111_CR27","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1006\/inco.1995.1149","volume":"122","author":"K. Pillaipakkamnatt","year":"1995","unstructured":"Pillaipakkamnatt, K., & Raghavan, V. (1995). Read-twice DNF formulas are properly learnable. Information and Computation, 122(2), 236\u2013267.","journal-title":"Information and Computation"},{"issue":"1","key":"181111_CR28","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1023\/A:1022643204877","volume":"1","author":"R. Quinlan","year":"1986","unstructured":"Quinlan, R. (1986). Induction of decision trees. Machine Learning, 1(1), 81\u2013106.","journal-title":"Machine Learning"},{"key":"181111_CR29","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1023\/A:1022699322624","volume":"5","author":"R. Quinlan","year":"1990","unstructured":"Quinlan, R. (1990). Learning logical definitions from relations. Machine Learning, 5, 239\u2013266.","journal-title":"Machine Learning"},{"issue":"3","key":"181111_CR30","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1023\/A:1022607331053","volume":"2","author":"R. Rivest","year":"1987","unstructured":"Rivest, R. (1987). Learning decision lists. Machine Learning, 2(3), 229\u2013246.","journal-title":"Machine Learning"},{"key":"181111_CR31","first-page":"641","volume-title":"Proceedings of the Seventh National Conference on Artificial Intelligence","author":"S. Russell","year":"1988","unstructured":"Russell, S. (1988). Tree-structured bias. In Proceedings of the Seventh National Conference on Artificial Intelligence, (pp. 641\u2013645). Saint Paul, MN: Morgan Kaufmann."},{"key":"181111_CR32","volume-title":"The Use of Knowledge in Analogy and Induction","author":"S. Russell","year":"1989","unstructured":"Russell, S. (1989). The Use of Knowledge in Analogy and Induction. Morgan Kaufmann, San Mateo, CA."},{"key":"181111_CR33","first-page":"1146","volume-title":"Proceedings of the 14th International Conference on Artificial Intelligence","author":"S. Russell","year":"1995","unstructured":"Russell, S., Binder, J., Koller, D., & Kanazawa, K. (1995). Local learning in probabilistic networks with hidden variables. In Proceedings of the 14\nth International Conference on Artificial Intelligence, (pp. 1146\u20131152). Montreal, Canada: Morgan Kaufmann."},{"key":"181111_CR34","first-page":"505","volume-title":"Proceedings of the National Conference on Artificial Intelligence","author":"S. Russell","year":"1987","unstructured":"Russell, S., & Grosof, B. (1987). A declarative approach to bias in concept learning. In Proceedings of the National Conference on Artificial Intelligence, (pp. 505\u2013510). Seattle, WA: Morgan Kaufmann."},{"key":"181111_CR35","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/978-1-4613-1523-0_16","volume-title":"Change of Representation and Inductive Bias","author":"S. Russell","year":"1990","unstructured":"Russell, S., & Grosof, B. (1990). Declarative bias: An overview. In Benjamin, D. (Ed.), Change of Representation and Inductive Bias, pp. 267\u2013308. Kluwer, Norwell, MA."},{"issue":"1","key":"181111_CR36","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1080\/09540098908915640","volume":"3","author":"J. Shavlik","year":"1989","unstructured":"Shavlik, J., & Towell, G. (1989). An approach to combining explanation-based and neural learning algorithms. Connection Science, 3(1), 231\u201353.","journal-title":"Connection Science"},{"key":"181111_CR37","first-page":"322","volume-title":"Proceedings of the Tenth International Conference on Machine Learning","author":"P. Tadepalli","year":"1993","unstructured":"Tadepalli, P. (1993). Learning from queries and examples with tree-structured bias. In Proceedings of the Tenth International Conference on Machine Learning, (pp. 322\u2013329). Amherst, MA: Morgan Kaufmann."},{"issue":"11","key":"181111_CR38","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. Valiant","year":"1984","unstructured":"Valiant, L. (1984). A theory of the learnable. Communications of the ACM, 27(11), 1134\u20131142.","journal-title":"Communications of the ACM"},{"key":"181111_CR39","volume-title":"The Complexity of Boolean Functions","author":"I. Wegener","year":"1987","unstructured":"Wegener, I. (1987). The Complexity of Boolean Functions. John Wiley & Sons, New York, NY."},{"issue":"3","key":"181111_CR40","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0020-7373(87)80056-1","volume":"27","author":"D. Wilkins","year":"1987","unstructured":"Wilkins, D., Clancey, W., & Buchanan, B. (1987). Knowledge base refinement by monitoring abstract control knowledge. International Journal of Man-Machine Studies, 27(3), 281\u2013293.","journal-title":"International Journal of Man-Machine Studies"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007421315813.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007421315813\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007421315813.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:46:52Z","timestamp":1752148012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007421315813"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["181111"],"URL":"https:\/\/doi.org\/10.1023\/a:1007421315813","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[1998,9]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}