{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:30Z","timestamp":1759626630672,"version":"build-2065373602"},"reference-count":26,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3760,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0304-3975(02)00420-6","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T20:16:11Z","timestamp":1048623371000},"page":"89-110","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Refutable language learning with a neighbor system"],"prefix":"10.1016","volume":"298","author":[{"given":"Yasuhito","family":"Mukouchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masako","family":"Sato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00420-6_BIB1","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","article-title":"Finding patterns common to a set of strings","volume":"21","author":"Angluin","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00420-6_BIB2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","article-title":"Inductive inference of formal languages from positive data","volume":"45","author":"Angluin","year":"1980","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(02)00420-6_BIB3","first-page":"47","article-title":"Elementary formal systems and formal languages\u2014simple formal systems","volume":"24","author":"Arikawa","year":"1970","journal-title":"Mem. Fac. Sci., Kyushu Univ. Ser. A, Math."},{"key":"10.1016\/S0304-3975(02)00420-6_BIB4","doi-asserted-by":"crossref","unstructured":"S. Arikawa, T. Shinohara, A. Yamamoto, Elementary formal systems as a unifying framework for language learning, Proc. 2nd Annu. ACM Workshop on Computational Learning Theory, 1989, pp. 312\u2013327.","DOI":"10.1016\/B978-0-08-094829-4.50025-8"},{"key":"10.1016\/S0304-3975(02)00420-6_BIB5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(92)90068-Q","article-title":"Learning elementary formal systems","volume":"95","author":"Arikawa","year":"1992","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(02)00420-6_BIB6","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine independent theory of the complexity of the recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(02)00420-6_BIB7","doi-asserted-by":"crossref","unstructured":"J. Case, S. Jain, Synthesizing learners tolerant computable noisy data, Proc. 9th Internat. Conf. on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence, Vol. 1501, 1998, pp. 205\u2013219.","DOI":"10.1007\/3-540-49730-7_16"},{"key":"10.1016\/S0304-3975(02)00420-6_BIB8","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","article-title":"Language identification in the limit","volume":"10","author":"Gold","year":"1967","journal-title":"Inform. and Control"},{"issue":"3","key":"10.1016\/S0304-3975(02)00420-6_BIB9","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1006\/jcss.1996.0089","article-title":"Program synthesis in the presence of infinite number of inaccuracies","volume":"53","author":"Jain","year":"1996","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/S0304-3975(02)00420-6_BIB10","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1006\/jcss.1998.1591","article-title":"Learning with refutation","volume":"57","author":"Jain","year":"1998","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00420-6_BIB11","doi-asserted-by":"crossref","unstructured":"S. Kobayashi, T. Yokomori, On approximately identifying concept classes in the limit, Proc. 6th Internat. Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence, Vol. 997, 1995, pp. 298\u2013312.","DOI":"10.1007\/3-540-60454-5_47"},{"key":"10.1016\/S0304-3975(02)00420-6_BIB12","doi-asserted-by":"crossref","unstructured":"S. Lange, P. Watson, Machine discovery in the presence of incomplete or ambiguous data, Proc. 5th Internat. Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence, Vol. 872, 1994, pp. 438\u2013452.","DOI":"10.1007\/3-540-58520-6_82"},{"key":"10.1016\/S0304-3975(02)00420-6_BIB13","doi-asserted-by":"crossref","unstructured":"S. Lange, T. Zeugmann, Types of monotonic language learning and their characterization, Proc. 5th Annu. ACM Workshop on Computational Learning Theory, 1992, pp. 377\u2013390.","DOI":"10.1145\/130385.130427"},{"year":"1984","series-title":"Foundations of Logic Programming","author":"Lloyd","key":"10.1016\/S0304-3975(02)00420-6_BIB14"},{"key":"10.1016\/S0304-3975(02)00420-6_BIB15","doi-asserted-by":"crossref","unstructured":"Y. Mukouchi, Characterization of finite identification, Proc. 3rd Internat. Workshop on Analogical and Inductive Inference, Lecture Notes in Artificial Intelligence, Vol. 642, 1992, pp. 260\u2013267.","DOI":"10.1007\/3-540-56004-1_18"},{"key":"10.1016\/S0304-3975(02)00420-6_BIB16","doi-asserted-by":"crossref","unstructured":"Y. Mukouchi, Inductive inference of an approximate concept from positive data, Proc. 4th Internat. Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence, Vol. 872, 1994, pp. 484\u2013499.","DOI":"10.1007\/3-540-58520-6_85"},{"issue":"3","key":"10.1016\/S0304-3975(02)00420-6_BIB17","first-page":"363","article-title":"Refutable inference with a restricted target class","volume":"49","author":"Mukouchi","year":"1999","journal-title":"Math. Japon."},{"key":"10.1016\/S0304-3975(02)00420-6_BIB18","doi-asserted-by":"crossref","unstructured":"Y. Mukouchi, S. Arikawa, Inductive inference machines that can refute hypothesis spaces, Proc. 4th Internat. Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence, Vol. 744, 1993, pp. 123\u2013136.","DOI":"10.1007\/3-540-57370-4_42"},{"key":"10.1016\/S0304-3975(02)00420-6_BIB19","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0304-3975(95)91135-D","article-title":"Towards a mathematical theory of machine discovery from facts","volume":"137","author":"Mukouchi","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00420-6_BIB20","doi-asserted-by":"crossref","unstructured":"Y. Mukouchi, M. Sato, Language learning with a neighbor system, Proc. 3rd Internat. Conf. on Discovery Science, Lecture Notes in Artificial Intelligence, Vol. 1967, 2000, pp. 183\u2013196.","DOI":"10.1007\/3-540-44418-1_15"},{"year":"1967","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","key":"10.1016\/S0304-3975(02)00420-6_BIB21"},{"issue":"1","key":"10.1016\/S0304-3975(02)00420-6_BIB22","doi-asserted-by":"crossref","first-page":"85","DOI":"10.5109\/13444","article-title":"Inductive inference of formal languages","volume":"27","author":"Sato","year":"1995","journal-title":"Bull. Inform. Cybernet."},{"key":"10.1016\/S0304-3975(02)00420-6_BIB23","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1006\/inco.1994.1006","article-title":"Rich classes inferable from positive data","volume":"108","author":"Shinohara","year":"1994","journal-title":"Inform. Comput."},{"year":"1961","series-title":"Theory of Formal Systems","author":"Smullyan","key":"10.1016\/S0304-3975(02)00420-6_BIB24"},{"key":"10.1016\/S0304-3975(02)00420-6_BIB25","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0304-3975(97)00018-2","article-title":"Noisy inference and oracles","volume":"185","author":"Stephan","year":"1997","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/S0304-3975(02)00420-6_BIB26","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0743-1066(92)90022-U","article-title":"Procedural semantics and negative information of elementary formal system","volume":"13","author":"Yamamoto","year":"1992","journal-title":"J. Logic Programming"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004206?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502004206?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:41Z","timestamp":1759625561000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502004206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0304397502004206"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00420-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2003,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Refutable language learning with a neighbor system","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(02)00420-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}