{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:30:52Z","timestamp":1742938252220,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540880080"},{"type":"electronic","value":"9783540880097"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88009-7_8","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:52:54Z","timestamp":1221882774000},"page":"98-110","source":"Crossref","is-referenced-by-count":1,"title":["Learning Bounded Unions of Noetherian Closed Set Systems Via Characteristic Sets"],"prefix":"10.1007","author":[{"given":"Yuuichi","family":"Kameda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroo","family":"Tokunaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akihiro","family":"Yamamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Inductive Inference of Formal Languages from Positive Data. Information and Control\u00a045, 117\u2013135 (1980)","journal-title":"Information and Control"},{"key":"8_CR2","unstructured":"Arimura, H., Shinohara, T., Otsuki, S.: Polynomial Time Inference of Unions of Tree Pattern, Languages. In: Proc. the 2nd Workshop on Algorithmic Learning Theory (ALT 1991), pp. 105\u2013114 (1991)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BFb0030389","volume-title":"Nonmonotonic and Inductive Logic","author":"H. Arimura","year":"1993","unstructured":"Arimura, H., Shinohara, T., Otsuki, S.: A Polynomial Time Algorithm for Finding Finite Unions of Tree Patterns. In: Brewka, G., Jantke, K.P., Schmitt, P.H. (eds.) NIL 1991. LNCS, vol.\u00a0659, pp. 118\u2013131. Springer, Heidelberg (1993)"},{"key":"8_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-69902-6_23","volume-title":"New Frontiers in Artificial Intelligence","author":"M. de Brecht","year":"2007","unstructured":"de Brecht, M., Kobayashi, M., Tokunaga, H., Yamamoto, A.: Inferability of Closed Set Systems From Positive Data. In: Washio, T., Satoh, K., Takeda, H., Inokuchi, A. (eds.) JSAI 2006. LNCS (LNAI), vol.\u00a04384, pp. 265\u2013275. Springer, Heidelberg (2007)"},{"key":"8_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/3-540-36169-3_2","volume-title":"Algorithmic Learning Theory","author":"S. Hayashi","year":"2002","unstructured":"Hayashi, S.: Mathematics Based on Learning. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds.) ALT 2002. LNCS (LNAI), vol.\u00a02533, pp. 7\u201321. Springer, Heidelberg (2002)"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0020-0190(92)90252-Q","volume":"44","author":"S. Kapur","year":"1992","unstructured":"Kapur, S., Bilardi, G.: On uniform learnability of language families. Information Processing Letters\u00a044, 35\u201338 (1992)","journal-title":"Information Processing Letters"},{"key":"8_CR7","unstructured":"Kobayashi, S.: Approximate Identification, Finite Elasticity and Lattice Structure of Hypothesis Space, Technical Report, CSIM 1996-2004, Dept. of Compt. Sci. and Inform. Math., Univ. of Electro-Communications (1996)"},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/B978-0-934613-40-8.50019-1","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"J.L. Lassez","year":"1988","unstructured":"Lassez, J.L., Maher, M.J., Marriott, K.: Unification Revisited. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 587\u2013626. Morgan-Kaufman, San Francisco (1988)"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0304-3975(00)00272-3","volume":"268","author":"F. Stephan","year":"2001","unstructured":"Stephan, F., Ventsov, Y.: Learning Algebraic Structures from Text. Theoretical Computer Science\u00a0268, 221\u2013273 (2001)","journal-title":"Theoretical Computer Science"},{"key":"8_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-540-78197-4_30","volume-title":"New Frontiers in Artificial Intelligence","author":"I. Takamatsu","year":"2008","unstructured":"Takamatsu, I., Kobayashi, M., Tokunaga, H., Yamamoto, A.: Computing Characteristic Sets of Bounded Unions of Polynomial Ideals. In: Satoh, K., Inokuchi, A., Nagao, K., Kawamura, T. (eds.) JSAI 2007. LNCS (LNAI), vol.\u00a04914, pp. 318\u2013329. Springer, Heidelberg (2008)"},{"key":"8_CR11","unstructured":"Tokunaga, H., Yamamoto, A.: Inductive Inference of Bounded Unions of Languages with Complete Characteristic Sets (in Japanese), SIG-FPAI-A703-01, 01-08 (2008)"},{"key":"8_CR12","first-page":"328","volume-title":"Proc. of COLT 1989","author":"K. Wright","year":"1989","unstructured":"Wright, K.: Identification of Unions of Languages Drawn from an Identifiable Class. In: Proc. of COLT 1989, pp. 328\u2013388. Morgan-Kaufman, San Francisco (1989)"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88009-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:49:30Z","timestamp":1715312970000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-88009-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540880080","9783540880097"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88009-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}