{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:29Z","timestamp":1759638989789},"reference-count":43,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6772,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1995,1]]},"DOI":"10.1016\/0304-3975(95)91135-d","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:43:01Z","timestamp":1027611781000},"page":"53-84","source":"Crossref","is-referenced-by-count":32,"title":["Towards a mathematical theory of machine discovery from facts"],"prefix":"10.1016","volume":"137","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":"78","reference":[{"key":"10.1016\/0304-3975(95)91135-D_BIB1","series-title":"Proc. 11th Ann. Symp. on Theory of Computing","first-page":"130","article-title":"Finding patterns common to a set of strings","author":"Angluin","year":"1979"},{"key":"10.1016\/0304-3975(95)91135-D_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\/0304-3975(95)91135-D_BIB3","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00116828","article-title":"Queries and concept learning","volume":"2","author":"Angluin","year":"1987","journal-title":"Mach. Learning"},{"issue":"3","key":"10.1016\/0304-3975(95)91135-D_BIB4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/356914.356918","article-title":"Inductive inference: theory and methods","volume":"15","author":"Angluin","year":"1983","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0304-3975(95)91135-D_BIB5","first-page":"47","article-title":"Elementary formal systems and formal languages \u2014 simple formal systems","volume":"24","author":"Arikawa","year":"1970","journal-title":"Mem. Fac. Sci. Kyushu Univ. Ser. A"},{"key":"10.1016\/0304-3975(95)91135-D_BIB6","series-title":"Proc. 25th Hawaii Internat. Conf. on System Sci.","first-page":"675","article-title":"A learning algorithm for elementary formal systems and its experiments on identification of transmembrane domains","author":"Arikawa","year":"1992"},{"issue":"3","key":"10.1016\/0304-3975(95)91135-D_BIB7_1","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF03037183","article-title":"A machine discovery from amino acid sequences by decision trees over regular patterns","volume":"11","author":"Arikawa","year":"1993","journal-title":"New Generation Comput."},{"issue":"4","key":"10.1016\/0304-3975(95)91135-D_BIB7_2","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF03037183","article-title":"A machine discovery from amino acid sequences by decision trees over regular patterns","volume":"11","author":"Arikawa","year":"1993","journal-title":"New Generation Comput."},{"key":"10.1016\/0304-3975(95)91135-D_BIB8","series-title":"Proc. 2nd Ann. ACM Workshop on Computational Learning Theory","first-page":"312","article-title":"Elementary formal systems as a unifying framework for language learning","author":"Arikawa","year":"1989"},{"key":"10.1016\/0304-3975(95)91135-D_BIB9","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."},{"key":"10.1016\/0304-3975(95)91135-D_BIB10","first-page":"227","article-title":"Completeness of depth-bounded resolution for weakly reducing programs","volume":"Vol. 31","author":"Arimura","year":"1991"},{"key":"10.1016\/0304-3975(95)91135-D_BIB11","series-title":"Proc. Intenat. Cong. of Mathematicians","first-page":"455","article-title":"Inductive inference of automata, functions and programs","author":"Birzdin","year":"1974"},{"key":"10.1016\/0304-3975(95)91135-D_BIB12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","article-title":"Toward a mathematical theory of inductive inference","volume":"28","author":"Blum","year":"1975","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(95)91135-D_BIB13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(83)90061-0","article-title":"Comparison of identification criteria for machine inductive inference","volume":"25","author":"Case","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)91135-D_BIB14","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"},{"key":"10.1016\/0304-3975(95)91135-D_BIB15","series-title":"Proc. 3rd Workshop on Algorithmic Learning Theory","article-title":"Monotonic language learning","volume":"Vol. 743","author":"Kapur","year":"1993"},{"key":"10.1016\/0304-3975(95)91135-D_BIB16","unstructured":"E. Kinber, personal communication, 1993."},{"key":"10.1016\/0304-3975(95)91135-D_BIB17","series-title":"Proc. 2nd Internat. Workshop on Nonmonotonic and Inductive Logic","first-page":"254","article-title":"Monotonic versus non-monotonic language learning","volume":"Vol. 659","author":"Lange","year":"1993"},{"key":"10.1016\/0304-3975(95)91135-D_BIB18","series-title":"Proc. 5th Ann. ACM Workshop on Computational Learning Theory","first-page":"377","article-title":"Types of monotonic language learning and their characterization","author":"Lange","year":"1992"},{"key":"10.1016\/0304-3975(95)91135-D_BIB19","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1142\/S0129054193000110","article-title":"Learning recursive languages with bounded mind changes","volume":"4","author":"Lange","year":"1994","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/0304-3975(95)91135-D_BIB20","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1984"},{"key":"10.1016\/0304-3975(95)91135-D_BIB21","series-title":"Being a Connected View of the Principles of Evidence and the Methods of Scientific Investigation","author":"Mill","year":"1919"},{"key":"10.1016\/0304-3975(95)91135-D_BIB22","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0304-3975(76)90087-6","article-title":"Some natural properties of strong-identification in inductive inference","volume":"2","author":"Minicozzi","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)91135-D_BIB23","series-title":"Proc. 3rd Internat. Workshop on Analogical and Inductive Inference","first-page":"260","article-title":"Characterization of finite identification","volume":"Vol. 642","author":"Mukouchi","year":"1992"},{"key":"10.1016\/0304-3975(95)91135-D_BIB24","series-title":"Proc. 4th Internat. Workshop on Algorithmic Learning Theory","first-page":"123","article-title":"Inductive inference machines that can refute hypothesis spaces","volume":"Vol. 744","author":"Mukouchi","year":"1993"},{"key":"10.1016\/0304-3975(95)91135-D_BIB25","series-title":"Systems that Learn","author":"Osherson","year":"1986"},{"key":"10.1016\/0304-3975(95)91135-D_BIB26","series-title":"Conjectures and Refutations","author":"Popper","year":"1963"},{"key":"10.1016\/0304-3975(95)91135-D_BIB27","series-title":"The Logic of Scientific Discovery","author":"Popper","year":"1965"},{"key":"10.1016\/0304-3975(95)91135-D_BIB28","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0304-3975(95)91135-D_BIB29","series-title":"Proc. 2nd Workshop on Algorithmic Learning Theory","first-page":"73","article-title":"Inductive inference of formal languages from positive data enumerated primitive-recursively","author":"Sakurai","year":"1991"},{"key":"10.1016\/0304-3975(95)91135-D_BIB30","article-title":"Inductive inference of theories from facts","author":"Shapiro","year":"1981"},{"issue":"1","key":"10.1016\/0304-3975(95)91135-D_BIB31","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0743-1066(84)90021-9","article-title":"Alternation and the computational complexity of logic programs","volume":"1","author":"Shapiro","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(95)91135-D_BIB32","doi-asserted-by":"crossref","first-page":"83","DOI":"10.5109\/13347","article-title":"Inferring unions of two pattern languages","volume":"20","author":"Shinohara","year":"1983","journal-title":"Bull. Inform. Cybernet."},{"key":"10.1016\/0304-3975(95)91135-D_BIB33_1","series-title":"Proc. 3rd Ann. ACM Workshop on Computational Learning Theory","first-page":"97","article-title":"Inductive inference from positive data is powerful","author":"Shinohara","year":"1990"},{"key":"10.1016\/0304-3975(95)91135-D_BIB33_2","unstructured":"a journal version is to appear as: Rich classes inferable from positive data: length-bounded elementary formal systems, Inform. Comput.."},{"key":"10.1016\/0304-3975(95)91135-D_BIB34","series-title":"Proc. 1st Internat. Workshop on Algorithmic Leraning Theory","first-page":"339","article-title":"Inductive inference of monotonic formal systems from positive data","author":"Shinohara","year":"1990"},{"key":"10.1016\/0304-3975(95)91135-D_BIB35","series-title":"Proc. 26th Hawaii Internat. Conf. on System Sci.","first-page":"763","article-title":"Finding alphabet indexing for decision trees over regular patterns: an approach to bioinformatical knowledge acquisition","author":"Shimozono","year":"1993"},{"key":"10.1016\/0304-3975(95)91135-D_BIB36","series-title":"Computational Models of Scientific Discovery and Theory Formation","year":"1990"},{"key":"10.1016\/0304-3975(95)91135-D_BIB37","series-title":"Theory of Formal Systems","author":"Smullyan","year":"1961"},{"key":"10.1016\/0304-3975(95)91135-D_BIB38","series-title":"Popperian Philosophy","author":"Takashima","year":"1974"},{"key":"10.1016\/0304-3975(95)91135-D_BIB39","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Commun. ACM"},{"key":"10.1016\/0304-3975(95)91135-D_BIB40","series-title":"Proc. 2nd Ann. ACM Workshop on Computational Learning Theory","first-page":"328","article-title":"Identification of unions of languages drawn from an identifiable class","author":"Wright","year":"1989"},{"issue":"4","key":"10.1016\/0304-3975(95)91135-D_BIB41","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:030439759591135D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759591135D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T02:32:59Z","timestamp":1620441179000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759591135D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["030439759591135D"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)91135-d","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}