{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:05Z","timestamp":1759638725817},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540573708"},{"type":"electronic","value":"9783540480969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57370-4_42","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:55:13Z","timestamp":1330260913000},"page":"123-136","source":"Crossref","is-referenced-by-count":15,"title":["Inductive inference machines that can refute hypothesis spaces"],"prefix":"10.1007","author":[{"given":"Yasuhito","family":"Mukouchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Setsuo","family":"Arikawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"10_CR1","unstructured":"Angluin, D.: Finding patterns common to a set of strings, Proc. 11th Annual Symposium on Theory of Computing (1979) 130\u2013141."},{"key":"10_CR2","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 45 (1980) 117\u2013135.","journal-title":"Information and Control"},{"key":"10_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":"10_CR4","doi-asserted-by":"publisher","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":"10_CR5","doi-asserted-by":"crossref","unstructured":"Arikawa, S., Kuhara, S., Miyano S., Shinohara, A. and Shinohara, T.: A learning algorithm for elementary formal systems and its experiments on identification of transmembrane domains, Proc. 25th Hawaii Inter. Conf. System Sciences (1992) 675\u2013684.","DOI":"10.1109\/HICSS.1992.183220"},{"key":"10_CR6","unstructured":"Arikawa, S., Kuhara, S., Miyano S., Mukouchi, Y., Shinohara, A. and Shinohara, T.: A machine discovery from amino acid sequences by decision trees over regular patterns, Proc. FGCS'92 (1992) 618\u2013625."},{"key":"10_CR7","first-page":"227","volume":"31","author":"H. Arimura","year":"1991","unstructured":"Arimura, H.: Completeness of depth-bounded resolution for weakly reducing programs, 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":"10_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L. Blum","year":"1975","unstructured":"Blum, L. and Blum, M.: Toward a mathematical theory of inductive inference, Information and Control 28 (1975) 125\u2013155.","journal-title":"Information and Control"},{"key":"10_CR9","doi-asserted-by":"publisher","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":"10_CR10","unstructured":"Kapur, S.: Monotonic language learning, Proc. 3rd Workshop on Algorithmic Learning Theory (1992) 147\u2013158."},{"key":"10_CR11","first-page":"254","volume":"659","author":"S. Lange","year":"1991","unstructured":"Lange, S. and Zeugmann, T.: Monotonic versus non-monotonic language learning, Proc. 2nd Inter. Workshop on Nonmonotonic and Inductive Logic (1991) (Lecture Notes in Artificial Intelligence, Vol. 659, 254\u2013269).","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Lange, S. and Zeugmann, T.: Types of monotonic language learning and their characterization, Proc. 5th Workshop on Comput. Learning Theory (1992) 377\u2013390.","DOI":"10.1145\/130385.130427"},{"key":"10_CR13","volume-title":"GOSLER-Report 16\/92","author":"S. Lange","year":"1992","unstructured":"Lange, S. and Zeugmann, T.: Learning recursive languages with bounded mind changes, GOSLER-Report 16\/92, FB Mathematik und Informatik, TH Leipzig, Sept. 1992."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Lloyd, J.W.: Foundations of logic programming, Springer-Verlag, 1984.","DOI":"10.1007\/978-3-642-96826-6"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0304-3975(76)90087-6","volume":"2","author":"E. Minicozzi","year":"1976","unstructured":"Minicozzi, E.: Some natural properties of strong-identification in inductive inference, Theoretical Computer Science 2 (1976) 345\u2013360.","journal-title":"Theoretical Computer Science"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Moriyama, T. and Sato, M.: Properties of language classes with finite elasticity, to appear in Proc. 4th Workshop on Algorithmic Learning Theory (1993).","DOI":"10.1007\/3-540-57370-4_47"},{"key":"10_CR17","unstructured":"Mukouchi, Y.: Characterization of pattern languages, Proc. 2nd Workshop on Algorithmic Learning Theory (1991) 93\u2013104 (also in IEICE Trans. Inf. &Syst., Vol. E75-D, No. 4 1992, 420\u2013425)."},{"key":"10_CR18","first-page":"260","volume":"642","author":"Y. Mukouchi","year":"1992","unstructured":"Mukouchi, Y.: Characterization of finite identification, Proc. 3rd Inter. Workshop on Analogical and Inductive Inference (1992) (Lecture Notes in Artificial Intelligence Vol. 642) 260\u2013267.","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Mukouchi, Y. and Arikawa, S.: Inductive Inference machines that can refute hypothesis spaces, RIFIS-TR-CS-67, Research Institute of Fundamental Information Science, Kyushu University, March 1993.","DOI":"10.1007\/3-540-57370-4_42"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Popper, R. K.: \u201cConjectures and refutations,\u201d Routledge and Kegan Paul, 1963.","DOI":"10.1063\/1.3050617"},{"key":"10_CR21","unstructured":"Popper, R. K.: \u201cThe logic of scientific discovery,\u201d Harper&Row, 1965."},{"key":"10_CR22","unstructured":"Sakurai, A.: Inductive inference of formal languages from positive data enumerated primitive-recursively, Proc. 2nd Workshop on Algorithmic Learning Theory (1991) 73\u201383."},{"key":"10_CR23","unstructured":"Shapiro, E.Y.: Inductive inference of theories from facts, Technical Report 192, Yale University Computer Science Dept., 1981."},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Shimozono, S., Shinohara, A., Shinohara, T., Miyano S., Kuhara S. and Arikawa S.: Finding alphabet indexing for decision trees over regular patterns: an approach to bioinformatical knowledge acquisition, Proc. 26th Hawaii Inter. Conf. System Sciences (1993) 763\u2013772.","DOI":"10.1109\/HICSS.1993.270664"},{"key":"10_CR25","doi-asserted-by":"crossref","first-page":"83","DOI":"10.5109\/13347","volume":"20","author":"T. Shinohara","year":"1983","unstructured":"Shinohara, T.: Inferring unions of two pattern languages, Bull. of Informatics and Cybernetics 20 (1983) 83\u201387.","journal-title":"Bull. of Informatics and Cybernetics"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Shinohara, T.: Inductive inference from positive data is powerful, Proc. 3rd Workshop on Comput. Learning Theory (1990) 97\u2013110.","DOI":"10.1016\/B978-1-55860-146-8.50010-2"},{"key":"10_CR27","unstructured":"Shrager, J. and Langley, P. (Editors): \u201cComputational models of scientific discovery and theory formation,\u201d Morgan Kaufmann, 1990."},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Smullyan, R.M.: \u201cTheory of formal systems,\u201d Princeton Univ. Press, 1961.","DOI":"10.1515\/9781400882007"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Wright, K.: Identification of unions of languages drawn from an identifiable class, Proc. 2nd Workshop on Comput. Learning Theory (1989) 328\u2013333.","DOI":"10.1016\/B978-0-08-094829-4.50026-X"},{"issue":"No.4","key":"10_CR30","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-57370-4_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:04:37Z","timestamp":1619571877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57370-4_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540573708","9783540480969"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-57370-4_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}