{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:58:39Z","timestamp":1725566319938},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540233565"},{"type":"electronic","value":"9783540302155"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30215-5_30","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T19:15:09Z","timestamp":1285096509000},"page":"395-409","source":"Crossref","is-referenced-by-count":2,"title":["New Revision Algorithms"],"prefix":"10.1007","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":"Bal\u00e1zs","family":"Sz\u00f6r\u00e9nyi","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":"30_CR1","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1006\/jcss.1995.1004","volume":"50","author":"A. Blum","year":"1995","unstructured":"Blum, A., Hellerstein, L., Littlestone, N.: Learning in the presence of finitely or infinitely many irrelevant attributes. J. of Comput. Syst. Sci.\u00a050, 32\u201340 (1995) Earlier version in 4th COLT (1991)","journal-title":"J. of Comput. Syst. Sci."},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1006\/jcss.1998.1571","volume":"56","author":"N. Bshouty","year":"1998","unstructured":"Bshouty, N., Hellerstein, L.: Attribute-efficient learning in query and mistakebound models. J. of Comput. Syst. Sci.\u00a056, 310\u2013319 (1998)","journal-title":"J. of Comput. Syst. Sci."},{"key":"30_CR3","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.: Bias-driven revision of logical domain theories. Journal of Artificial Intelligence Research\u00a01, 159\u2013208 (1994)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(94)90028-0","volume":"66","author":"D. Ourston","year":"1994","unstructured":"Ourston, D., Mooney, R.J.: Theory refinement combining analytical and empirical methods. Artificial Intelligence\u00a066, 273\u2013309 (1994)","journal-title":"Artificial Intelligence"},{"key":"30_CR5","first-page":"95","volume":"19","author":"B.L. Richards","year":"1995","unstructured":"Richards, B.L., Mooney, R.J.: Automated refinement of first-order Horn-clause domain theories. Machine Learning\u00a019, 95\u2013131 (1995)","journal-title":"Machine Learning"},{"key":"30_CR6","first-page":"71","volume":"13","author":"G.G. Towell","year":"1993","unstructured":"Towell, G.G., Shavlik, J.W.: Extracting refined rules from knowledge-based neural networks. Machine Learning\u00a013, 71\u2013101 (1993)","journal-title":"Machine Learning"},{"key":"30_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2317-5","volume-title":"Concept Formation and Knowledge Revision","author":"S. Wrobel","year":"1994","unstructured":"Wrobel, S.: Concept Formation and Knowledge Revision. Kluwer, Dordrecht (1994)"},{"key":"30_CR8","first-page":"14","volume-title":"Advances in ILP","author":"S. Wrobel","year":"1995","unstructured":"Wrobel, S.: First order theory refinement. In: De Raedt, L. (ed.) Advances in ILP, pp. 14\u201333. IOS Press, Amsterdam (1995)"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1013641821190","volume":"47","author":"J. Goldsmith","year":"2002","unstructured":"Goldsmith, J., Sloan, R.H., Tur\u00e1n, G.: Theory revision with queries: DNF formulas. Machine Learning\u00a047, 257\u2013295 (2002)","journal-title":"Machine Learning"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.artint.2004.01.002","volume":"156","author":"J. Goldsmith","year":"2004","unstructured":"Goldsmith, J., Sloan, R.H., Sz\u00f6r\u00e9nyi, B., Tur\u00e1n, G.: Theory revision with queries: Horn, read-once, and parity formulas. Artificial Intelligence\u00a0156, 139\u2013176 (2004)","journal-title":"Artificial Intelligence"},{"key":"30_CR11","first-page":"43","volume-title":"Computational Learning Theory and Natural Learning Systems. Volume III: Selecting Good Models","author":"R.J. Mooney","year":"1995","unstructured":"Mooney, R.J.: A preliminary PAC analysis of theory revision. In: Petsche, T. (ed.) Computational Learning Theory and Natural Learning Systems. Volume III: Selecting Good Models, pp. 43\u201353. MIT Press, Cambridge (1995)"},{"key":"30_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-3-540-45167-9_45","volume-title":"Learning Theory and Kernel Machines","author":"R.H. Sloan","year":"2003","unstructured":"Sloan, R.H., Sz\u00f6r\u00e9nyi, B., Tur\u00e1n, G.: Projective DNF formulae and their revision. In: Sch\u00f6lkopf, B., Warmuth, M.K. (eds.) COLT\/Kernel 2003. LNCS (LNAI), vol.\u00a02777, pp. 625\u2013639. Springer, Heidelberg (2003)"},{"key":"30_CR13","unstructured":"Doshi, J.U.: Revising Horn formulas. Master\u2019s thesis, Dept. of Computer Science, University of Kentucky (2003)"},{"key":"30_CR14","first-page":"147","volume":"9","author":"D. Angluin","year":"1992","unstructured":"Angluin, D., Frazier, M., Pitt, L.: Learning conjunctions of Horn clauses. Machine Learning\u00a09, 147\u2013164 (1992)","journal-title":"Machine Learning"},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1023\/A:1007678005361","volume":"37","author":"L.G. Valiant","year":"1999","unstructured":"Valiant, L.G.: Projection learning. Machine Learning\u00a037, 115\u2013130 (1999)","journal-title":"Machine Learning"},{"key":"30_CR16","unstructured":"Pinker, S.: The Blank Slate: The Modern Denial of Human Nature. Viking Press (2002)"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"854","DOI":"10.1145\/355483.355486","volume":"47","author":"L.G. Valiant","year":"2000","unstructured":"Valiant, L.G.: A neuroidal architecture for cognitive computation. Journal of the ACM\u00a047, 854\u2013882 (2000)","journal-title":"Journal of the ACM"},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0004-3702(00)00002-3","volume":"117","author":"L.G. Valiant","year":"2000","unstructured":"Valiant, L.G.: Robust logics. Artificial Intelligence\u00a0117, 231\u2013253 (2000)","journal-title":"Artificial Intelligence"},{"key":"30_CR19","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N.: Learning quickly when irrelevant attributes abound: A new linearthreshold algorithm. Machine Learning\u00a02, 285\u2013318 (1988)","journal-title":"Machine Learning"},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/3-540-62685-9_15","volume-title":"Computational Learning Theory","author":"R. Uehara","year":"1997","unstructured":"Uehara, R., Tsuchida, K., Wegener, I.: Optimal attribute-efficient learning of disjunction, parity, and threshold functions. In: Ben-David, S. (ed.) EuroCOLT 1997. LNCS, vol.\u00a01208, pp. 171\u2013184. Springer, Heidelberg (1997)"},{"key":"30_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1007\/3-540-63577-7_60","volume-title":"Algorithmic Learning Theory","author":"T. Heged\u00fcs","year":"1997","unstructured":"Heged\u00fcs, T., Indyk, P.: On learning disjunctions of zero-one threshold functions with queries. In: Li, M. (ed.) ALT 1997. LNCS, vol.\u00a01316, pp. 446\u2013460. Springer, Heidelberg (1997)"},{"key":"30_CR22","series-title":"The Institute of Mathematics and its Applications Conference Series","first-page":"69","volume-title":"Computational Learning Theory: EuroColt 1993.","author":"T. Heged\u00fcs","year":"1994","unstructured":"Heged\u00fcs, T.: On training simple neural networks and small-weight neurons. In: Computational Learning Theory: EuroColt 1993. The Institute of Mathematics and its Applications Conference Series, vol.\u00a053, pp. 69\u201382. Oxford University Press, Oxford (1994)"},{"key":"30_CR23","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L. Pitt","year":"1988","unstructured":"Pitt, L., Valiant, L.G.: Computational limitations on learning from examples. J. ACM\u00a035, 965\u2013984 (1988)","journal-title":"J. ACM"},{"key":"30_CR24","first-page":"211","volume":"1","author":"M. Schmitt","year":"1995","unstructured":"Schmitt, M.: On methods to keep learning away from intractability. Proc. International Conference on Artifical Neural Networks (ICANN) 1995\u00a01, 211\u2013216 (1995)","journal-title":"Proc. International Conference on Artifical Neural Networks (ICANN) 1995"},{"key":"30_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/3-540-62685-9_5","volume-title":"Computational Learning Theory","author":"R.H. Sloan","year":"1997","unstructured":"Sloan, R.H., Tur\u00e1n, G.: Learning from incomplete boundary queries using split graphs and hypergraphs. In: Ben-David, S. (ed.) EuroCOLT 1997. LNCS, vol.\u00a01208, pp. 38\u201350. Springer, Heidelberg (1997)"},{"key":"30_CR26","unstructured":"Angluin, D.: Learning propositional Horn sentences with hints. Technical Report YALEU\/DCS\/RR-590, Department of Computer Science, Yale University (1987)"},{"key":"30_CR27","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1109\/69.469822","volume":"7","author":"P.L. Hammer","year":"1995","unstructured":"Hammer, P.L., Kogan, A.: Quasi-acyclic propositional Horn knowledge bases: optimal compression. IEEE Trans. Knowl. Data Eng.\u00a07, 751\u2013762 (1995)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"30_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1007\/3-540-63577-7_59","volume-title":"Algorithmic Learning Theory","author":"H. Arimura","year":"1997","unstructured":"Arimura, H.: Learning acyclic first-order Horn sentences from entailment. In: Li, M. (ed.) ALT 1997. LNCS, vol.\u00a01316, pp. 432\u2013445. Springer, Heidelberg (1997)"},{"key":"30_CR29","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Machine Learning\u00a02, 319\u2013342 (1988)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30215-5_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:56:38Z","timestamp":1620014198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30215-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233565","9783540302155"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30215-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}