{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T00:05:51Z","timestamp":1752192351537,"version":"3.41.2"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":[[2002,5]]},"DOI":"10.1023\/a:1013641821190","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T17:11:47Z","timestamp":1040663507000},"page":"257-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Theory Revision with Queries: DNF Formulas"],"prefix":"10.1007","volume":"47","author":[{"given":"Judy","family":"Goldsmith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert H.","family":"Sloan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gy\u00f6rgy","family":"Tur\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"391591_CR1","doi-asserted-by":"crossref","unstructured":"Alexin, Z., Gyim\u00f3thy, T., & Bostr\u00f6m, H. (1997). IMPUT: An interactive learning tool based on program specialization. Intelligent Data Analysis, 1:4. <http:\/\/www-east.elsevier.com\/ida\/>.","DOI":"10.3233\/IDA-1997-1402"},{"issue":"4","key":"391591_CR2","first-page":"319","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"},{"key":"391591_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. J. ACM, 40, 185\u2013210.","journal-title":"J. ACM"},{"key":"391591_CR4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1613\/jair.438","volume":"8","author":"S. Argamon-Engelson","year":"1998","unstructured":"Argamon-Engelson, S., & Koppel, M. (1998). Tractability of theory patching. Journal of Artificial Intelligence Research, 8, 39\u201365.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1","key":"391591_CR5","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1006\/jcss.1995.1004","volume":"50","author":"A. Blum","year":"1995","unstructured":"Blum, A., Hellerstein, L., & Littlestone, N. (1995). Learning in the presence of finitely or infinitely many irrelevant attributes. J. of Comput. Syst. Sci., 50:1, 32\u201340. Earlier version in 4th COLT, 1991.","journal-title":"J. of Comput. Syst. Sci."},{"key":"391591_CR6","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01205054","volume":"4","author":"N. Bshouty","year":"1994","unstructured":"Bshouty, N., Hancock, T., Hellerstein, L., & Karpinski, M. (1994). An algorithm to learn read-once threshold formulas, and transformations between learning models. Computational Complexity, 4, 37\u201361.","journal-title":"Computational Complexity"},{"key":"391591_CR7","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1006\/jcss.1998.1571","volume":"56","author":"N. Bshouty","year":"1998","unstructured":"Bshouty, N., & Hellerstein, L. (1998). Attribute-efficient learning in query and mistake-bound models. J. Comput. Syst. Sci., 56, 310\u2013319.","journal-title":"J. Comput. Syst. Sci."},{"key":"391591_CR8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/jcss.1997.1508","volume":"55","author":"J. Case","year":"1997","unstructured":"Case, J., Kaufmann, S., Kinber, E., & Kummer, M. (1997). Learning recursive functions from approximations. J. Comput. Syst. Sci., 55, 183\u2013196.","journal-title":"J. Comput. Syst. Sci."},{"key":"391591_CR9","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/B978-0-934613-67-5.50012-5","volume-title":"Exploring artificial intelligence: Survey talks from the national conferences on artificial intelligence","author":"R. Davis","year":"1988","unstructured":"Davis, R., & Hamscher, W. (1988). Model-based reasoning: Troubleshooting. In H. E. Shrobe, & the American Association for Artificial Intelligence (Eds.), Exploring artificial intelligence: Survey talks from the national conferences on artificial intelligence (Ch. 8, pp. 297\u2013346). San Mateo, CA: Morgan Kaufmann."},{"key":"391591_CR10","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0004-3702(92)90027-U","volume":"56","author":"J. de Kleer","year":"1992","unstructured":"de Kleer, J., Mackworth, A. K., & Reiter, R. (1992). Characterizing diagnoses and systems. Artificial Intelligence, 56, 197\u2013222.","journal-title":"Artificial Intelligence"},{"key":"391591_CR11","doi-asserted-by":"crossref","unstructured":"Goldsmith, J., & Sloan, R. H. (2000). More theory revision with queries. In Proc. 32nd Annu. ACM Sympos. Theory Comput. (pp. 441-448).","DOI":"10.1145\/335305.335356"},{"key":"391591_CR12","first-page":"236","volume-title":"Proc. 13th Annu. Conference on Comput. Learning Theory","author":"J. Goldsmith","year":"2000","unstructured":"Goldsmith, J., Sloan, R. H., Sz\u00f6r\u00e9nyi, B., & Tur\u00e1n, G. (2000). Improved algorithms for theory revision with queries. In Proc. 13th Annu. Conference on Comput. Learning Theory (pp. 236\u2013247). San Francisco: Morgan Kaufmann."},{"key":"391591_CR13","unstructured":"Goldsmith, J., Sloan, R. H., Sz\u00a8or\u00b4enyi, B., & Tur\u00b4an, G. (2001). Theory revision with queries: Horn and related formulas. In preparation."},{"issue":"1","key":"391591_CR14","first-page":"27","volume":"14","author":"D. P. Helmbold","year":"1994","unstructured":"Helmbold, D. P., & Long, P. M. (1994). Tracking drifting concepts by minimizing disagreements. Machine Learning, 14:1, 27\u201345.","journal-title":"Machine Learning"},{"issue":"2","key":"391591_CR15","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0890-5401(91)90043-2","volume":"95","author":"S. Jain","year":"1991","unstructured":"Jain, S., & Sharma, A. (1991). Learning in the presence of partial explanations. Inform. Comput., 95:2, 162\u2013191.","journal-title":"Inform. Comput."},{"key":"391591_CR16","volume-title":"Switching and finite automata theory","author":"Z. Kohavi","year":"1978","unstructured":"Kohavi, Z. (1978). Switching and finite automata theory. 2nd edn. New York, NY: McGraw-Hill.","edition":"2nd edn."},{"key":"391591_CR17","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1613\/jair.27","volume":"1","author":"M. Koppel","year":"1994","unstructured":"Koppel, M., Feldman, R., & Segre, A. M. (1994). Bias-driven revision of logical domain theories. Journal of Artificial Intelligence Research, 1, 159\u2013208.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1","key":"391591_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90050-6","volume":"33","author":"J. E. Laird","year":"1987","unstructured":"Laird, J. E., Newell, A., & Rosenbloom, P. S. (1987). SOAR: An architecture for general intelligence. Artificial Intelligence, 33:1, 1\u201364.","journal-title":"Artificial Intelligence"},{"key":"391591_CR19","first-page":"304","volume-title":"Performance and fault modeling with VHDL","author":"R. A. Marcotte","year":"1992","unstructured":"Marcotte, R. A., Neiberg, M. J., Piazza, R. L., & Holtzblatt, L. J. (1992). Model-based diagnostic reasoning using VHDL. In J. M. Schoen (Ed.), Performance and fault modeling with VHDL (Ch. 6, pp. 304\u2013399). Englewood Cliffs, NJ: Prentice Hall."},{"key":"391591_CR20","unstructured":"Mooney, R. J. (1995). A preliminary PAC analysis of theory revision. In Computational learning theory and natural learning systems, Vol. III: Selecting Good Models (Ch. 3, pp. 43-53). MIT Press."},{"key":"391591_CR21","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0004-3702(94)90028-0","volume":"66","author":"D. Ourston","year":"1994","unstructured":"Ourston, D., & Mooney, R. J. (1994). Theory refinement combining analytical and empirical methods. Artificial Intelligence, 66, 273\u2013309.","journal-title":"Artificial Intelligence"},{"key":"391591_CR22","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0004-3702(87)90062-2","volume":"32","author":"R. Reiter","year":"1987","unstructured":"Reiter, R. (1987). A theory of diagnosis from first principles. Artificial Intelligence, 32, 57\u201395.","journal-title":"Artificial Intelligence"},{"key":"391591_CR23","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1023\/A:1022611224557","volume":"19","author":"B. L. Richards","year":"1995","unstructured":"Richards, B. L., & Mooney, R. J. (1995) Automated refinement of first-order Horn-clause domain theories. Machine Learning, 19, 95\u2013131.","journal-title":"Machine Learning"},{"key":"391591_CR24","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1006\/inco.1994.1081","volume":"114","author":"R. L. Rivest","year":"1994","unstructured":"Rivest, R. L., & Sloan, R. (1994). A formal model of hierarchical concept learning. Inform. Comput., 114, 88\u2013114.","journal-title":"Inform. Comput."},{"key":"391591_CR25","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1192.001.0001","volume-title":"Algorithmic program debugging","author":"E. Y. Shapiro","year":"1983","unstructured":"Shapiro, E. Y. (1983). Algorithmic program debugging. Cambridge, MA: MIT Press."},{"key":"391591_CR26","first-page":"41","volume-title":"Proc. 12th Annu. Conf. on Comput. Learning Theory","author":"R. H. Sloan","year":"1999","unstructured":"Sloan, R. H., & Tur\u00e1n, G. (1999). On theory revision with queries. In Proc. 12th Annu. Conf. on Comput. Learning Theory (pp. 41\u201352). New York, NY: ACM Press."},{"key":"391591_CR27","unstructured":"Sz\u00f6r\u00e9nyi, B. (2000). Revision algorithms in computational learning theory. Master's thesis, Dept. of Computer Science, University of Szeged. (In Hungarian.)."},{"key":"391591_CR28","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1022683529158","volume":"13","author":"G. G. Towell","year":"1993","unstructured":"Towell, G. G., & Shavlik, J. W. (1993). Extracting refined rules from knowledge-based neural networks. Machine Learning, 13, 71\u2013101.","journal-title":"Machine Learning"},{"issue":"1\/2","key":"391591_CR29","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0004-3702(94)90105-8","volume":"70","author":"G. G. Towell","year":"1994","unstructured":"Towell, G. G., & Shavlik, J. W. (1994). Knowledge-based artificial neural networks. Artificial Intelligence, 70:1\/2, 119\u2013165.","journal-title":"Artificial Intelligence"},{"key":"391591_CR30","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/3-540-62685-9_15","volume-title":"Computational learning theory: EuroColt '97","author":"R. Uehara","year":"1997","unstructured":"Uehara, R., Tsuchida, K., & Wegener, I. (1997). Optimal attribute-efficient learning of disjunction, parity, and threshold functions. In Computational learning theory: EuroColt '97, Berlin: Springer-Verlag (pp. 171\u2013184)."},{"key":"391591_CR31","first-page":"14","volume-title":"Advances in ILP","author":"S. Wrobel","year":"1995","unstructured":"Wrobel, S. (1995). First order theory refinement. In L. De Raedt (Ed.), Advances in ILP (pp. 14\u201333). Amsterdam: IOS Press."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013641821190.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013641821190\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013641821190.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:31:15Z","timestamp":1752147075000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013641821190"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":31,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["391591"],"URL":"https:\/\/doi.org\/10.1023\/a:1013641821190","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2002,5]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}