{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:33:40Z","timestamp":1740548020026,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"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_31","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T19:15:09Z","timestamp":1285096509000},"page":"410-424","source":"Crossref","is-referenced-by-count":1,"title":["The Subsumption Lattice and Query Learning"],"prefix":"10.1007","author":[{"given":"Marta","family":"Arias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roni","family":"Khardon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"31_CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Machine Learning\u00a02(4), 319\u2013342 (1988)","journal-title":"Machine Learning"},{"key":"31_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/3-540-45583-3_3","volume-title":"Algorithmic Learning Theory","author":"D. Angluin","year":"2001","unstructured":"Angluin, D.: Queries revisited. In: Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. LNCS (LNAI), vol.\u00a02225, pp. 12\u201331. Springer, Heidelberg (2001)"},{"key":"31_CR3","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/S0890-5401(02)93162-7","volume":"178","author":"M. Arias","year":"2002","unstructured":"Arias, M., Khardon, R.: Learning closed Horn expressions. Information and Computation\u00a0178, 214\u2013240 (2002)","journal-title":"Information and Computation"},{"key":"31_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-540-39917-9_4","volume-title":"Inductive Logic Programming","author":"M. Arias","year":"2003","unstructured":"Arias, M., Khardon, R.: Complexity parameters for first-order structures. In: Horv\u00e1th, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol.\u00a02835, pp. 22\u201337. Springer, Heidelberg (2003)"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Arias, M., Khardon, R.: The subsumption lattice and query learning. Technical Report 2004-7, Department of Computer Science, Tufts University (2004)","DOI":"10.1007\/978-3-540-30215-5_31"},{"key":"31_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-540-45167-9_39","volume-title":"Learning Theory and Kernel Machines","author":"M. Arias","year":"2003","unstructured":"Arias, M., Khardon, R., Servedio, R.A.: Polynomial certificates for propositional classes. In: Sch\u00f6lkopf, B., Warmuth, M.K. (eds.) COLT\/Kernel 2003. LNCS (LNAI), vol.\u00a02777, pp. 537\u2013551. Springer, Heidelberg (2003)"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","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, Springer, Heidelberg (1997)"},{"key":"31_CR8","volume-title":"Proceedings of the 6th Conference on Algorithmic Learning Theory","author":"L. Raedt De","year":"1995","unstructured":"De Raedt, L., Van Laer, W.: Inductive constraint logic. In: Proceedings of the 6th Conference on Algorithmic Learning Theory, vol.\u00a0997, Springer, Heidelberg (1995)"},{"key":"31_CR9","unstructured":"Esposito, F., Fanizzi, N., Ferilli, S., Semeraro, G.: Ideal theory refinement under object identity. In: Proceedings of the International Conference on Machine Learning, pp. 263\u2013270 (2000)"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/jcss.1995.1003","volume":"50","author":"S.A. Goldman","year":"1995","unstructured":"Goldman, S.A., Kearns, M.: On the complexity of teaching. Journal of Computer and System Sciences\u00a050, 20\u201331 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/225298.225311","volume-title":"Proceedings of the Conference on Computational Learning Theory","author":"T. Hegedus","year":"1995","unstructured":"Hegedus, T.: On generalized teaching dimensions and the query complexity of learning. In: Proceedings of the Conference on Computational Learning Theory, New York, NY, USA, July 1995, pp. 108\u2013117. ACM Press, New York (1995)"},{"issue":"5","key":"31_CR12","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1145\/234752.234755","volume":"43","author":"L. Hellerstein","year":"1996","unstructured":"Hellerstein, L., Pillaipakkamnatt, K., Raghavan, V., Wilkins, D.: How many queries are needed to learn? Journal of the ACM\u00a043(5), 840\u2013862 (1996)","journal-title":"Journal of the ACM"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1007610422992","volume":"37","author":"R. Khardon","year":"1999","unstructured":"Khardon, R.: Learning function free Horn expressions. Machine Learning\u00a037, 241\u2013275 (1999)","journal-title":"Machine Learning"},{"key":"31_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of logic programming; (2nd extended ed.)","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of logic programming (2nd extended ed.). Springer, New York (1987)"},{"key":"31_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-62927-0","volume-title":"Foundations of Inductive Logic Programming","author":"S. Nienhuys-Cheng","year":"1997","unstructured":"Nienhuys-Cheng, S., De Wolf, R.: Foundations of Inductive Logic Programming. LNCS, vol.\u00a01228. Springer, Heidelberg (1997)"},{"key":"31_CR16","first-page":"153","volume":"5","author":"G.D. Plotkin","year":"1970","unstructured":"Plotkin, G.D.: A note on inductive generalization. Machine Intelligence\u00a05, 153\u2013163 (1970)","journal-title":"Machine Intelligence"},{"key":"31_CR17","first-page":"239","volume":"5","author":"J.R. Quinlan","year":"1990","unstructured":"Quinlan, J.R.: Learning logical definitions from relations. Machine Learning\u00a05, 239\u2013266 (1990)","journal-title":"Machine Learning"},{"key":"31_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-49730-7_11","volume-title":"Algorithmic Learning Theory","author":"K. Rao","year":"1998","unstructured":"Rao, K., Sattar, A.: Learning from entailment of logic programs with local variables. In: Richter, M.M., Smith, C.H., Wiehagen, R., Zeugmann, T. (eds.) ALT 1998. LNCS (LNAI), vol.\u00a01501, pp. 143\u2013157. Springer, Heidelberg (1998)"},{"key":"31_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/3540635149_53","volume-title":"Inductive Logic Programming","author":"C. Reddy","year":"1997","unstructured":"Reddy, C., Tadepalli, P.: Learning Horn definitions with equivalence and membership queries. In: D\u017eeroski, S., Lavra\u010d, N. (eds.) ILP 1997. LNCS, vol.\u00a01297, pp. 243\u2013255. Springer, Heidelberg (1997)"},{"key":"31_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BFb0027308","volume-title":"Inductive Logic Programming","author":"C. Reddy","year":"1998","unstructured":"Reddy, C., Tadepalli, P.: Learning first order acyclic Horn programs from entailment. In: Page, D.L. (ed.) ILP 1998. LNCS, vol.\u00a01446, pp. 23\u201337. Springer, Heidelberg (1998)"},{"key":"31_CR21","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.: Algorithmic Program Debugging. MIT Press, Cambridge (1983)"}],"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_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T23:45:01Z","timestamp":1740527101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30215-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233565","9783540302155"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30215-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}