{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:50Z","timestamp":1759638770501},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540585206"},{"type":"electronic","value":"9783540490302"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58520-6_85","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:35:01Z","timestamp":1330274101000},"page":"484-499","source":"Crossref","is-referenced-by-count":7,"title":["Inductive inference of an approximate concept from positive data"],"prefix":"10.1007","author":[{"given":"Yasuhito","family":"Mukouchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"40_CR1","unstructured":"Angluin, D.: Finding patterns common to a set of strings, in Proc. 11th Annual Symposium on Theory of Computing (1979) 130\u2013141."},{"key":"40_CR2","doi-asserted-by":"crossref","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 45 (1980) 117\u2013135.","journal-title":"Information and Control"},{"key":"40_CR3","first-page":"47","volume":"24","author":"S. Arikawa","year":"1970","unstructured":"Arikawa, S.: Elementary formal systems and formal languages \u2014 simple formal systems, Memoirs of Fac. Sci., Kyushu Univ., Ser. A, Math. 24 (1970) 47\u201375.","journal-title":"Memoirs of Fac. Sci., Kyushu Univ., Ser. A, Math."},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Arikawa, S., Shinohara, T. and Yamamoto, A.: Elementary formal systems as a unifying framework for language learning, in Proc. 2nd Workshop on Computational Learning Theory (1989) 312\u2013327.","DOI":"10.1016\/B978-0-08-094829-4.50025-8"},{"key":"40_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(92)90068-Q","volume":"95","author":"S. Arikawa","year":"1992","unstructured":"Arikawa, S., Shinohara, T. and Yamamoto, A.: Learning elementary formal systems, Theoretical Computer Science 95 (1992) 97\u2013113.","journal-title":"Theoretical Computer Science"},{"key":"40_CR6","first-page":"227","volume":"31","author":"H. Arimura","year":"1991","unstructured":"Arimura, H.: Completeness of depth-bounded resolution for weakly reducing programs, in Proc. Software Science and Engineering (1991) (World Scientific Series in Computer Science Vol. 31) 227\u2013245.","journal-title":"World Scientific Series in Computer Science"},{"key":"40_CR7","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit, Information and Control 10 (1967) 447\u2013474.","journal-title":"Information and Control"},{"key":"40_CR8","unstructured":"Kapur, S.: Computational learning of languages, PhD thesis, Technical Report 91-1234, Cornell University, 1991."},{"key":"40_CR9","unstructured":"Kapur, S.: Personal communication."},{"key":"40_CR10","first-page":"187","volume":"744","author":"T. Moriyama","year":"1993","unstructured":"Moriyama, T. and Sato, M.: Properties of language classes with finite elasticity, in Proc. 4th International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 744 (1993) 187\u2013196.","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"Motoki, T, Shinohara, T. and Wright, K.: The correct definition of finite elasticity: corrigendum to identification of unions, in Proc. 4th Workshop on Computational Learning Theory (1991) 375\u2013375.","DOI":"10.1016\/B978-1-55860-213-7.50037-7"},{"key":"40_CR12","first-page":"123","volume":"744","author":"Y. Mukouchi","year":"1993","unstructured":"Mukouchi, Y. and Arikawa, S.: Inductive inference machines that can refute hypothesis spaces, in Proc. 4th International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence 744 (1993) 123\u2013137.","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"40_CR13","unstructured":"Mukouchi, Y. and Arikawa, S.: Towards a mathematical theory of machine discovery from facts, in preparation."},{"key":"40_CR14","unstructured":"Sakurai, A.: Inductive inference of formal languages from positive data enumerated primitive-recursively, in Proc. 2nd Workshop on Algorithmic Learning Theory (1991) 73\u201383."},{"key":"40_CR15","unstructured":"Sato, M. and Umayahara, K.: Inductive inferability for formal languages from positive data, in Proc. 2nd Workshop on Algorithmic Learning Theory (1991) 84\u201392 (also in IEICE Trans. Inf. &Syst. E75-D No. 4 (1992) 415\u2013419)."},{"key":"40_CR16","unstructured":"Sato, M. and Moriyama, T.: Inductive inference of length-bounded EFS's from positive data, in preparation (1993)."},{"key":"40_CR17","unstructured":"Sato, M.: Personal communication."},{"key":"40_CR18","unstructured":"Shapiro, E.Y.: Inductive inference of theories from facts, Technical Report 192, Yale University Computer Science Dept., 1981."},{"issue":"No.1","key":"40_CR19","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0743-1066(84)90021-9","volume":"1","author":"E.Y. Shapiro","year":"1984","unstructured":"Shapiro, E.Y.: Alternation and the computational complexity of logic programs, J. Logic Programming 1 No. 1 (1984) 19\u201333.","journal-title":"J. Logic Programming"},{"key":"40_CR20","doi-asserted-by":"crossref","unstructured":"Shinohara, T.: Inductive inference from positive data is powerful, Proc. 3rd Workshop on Computational Learning Theory (1990) 97\u2013110 (to appear as Rich classes inferable from positive data: Length-bounded elementary formal systems, in Information and Computation).","DOI":"10.1016\/B978-1-55860-146-8.50010-2"},{"key":"40_CR21","unstructured":"Shinohara, T.: Inductive inference of monotonic formal systems from positive data, In Proc. 1st International Workshop on Algorithmic Learning Theory (1990) 339\u2013351 (also in New Generation Computing 8 No. 4 (1991) 371\u2013384)."},{"key":"40_CR22","doi-asserted-by":"crossref","unstructured":"Smullyan, R.M.: \u201cTheory of formal systems,\u201d Princeton Univ. Press, 1961.","DOI":"10.1515\/9781400882007"},{"key":"40_CR23","doi-asserted-by":"crossref","unstructured":"Wright, K.: Identification of unions of languages drawn from an identifiable class, in Proc. 2nd Workshop on Computational Learning Theory (1989) 328\u2013333.","DOI":"10.1016\/B978-0-08-094829-4.50026-X"},{"issue":"No.4","key":"40_CR24","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0743-1066(92)90022-U","volume":"13","author":"A. Yamamoto","year":"1992","unstructured":"Yamamoto, A.: Procedural semantics and negative information of elementary formal system, J. Logic Programming 13 No. 4 (1992) 89\u201398.","journal-title":"J. Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58520-6_85.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:23:01Z","timestamp":1605648181000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58520-6_85"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540585206","9783540490302"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-58520-6_85","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}