Characterization of Finite Identification
作者： Yasuhito Mukouchi
关键词: Inference 、 Logic programming 、 Algorithm 、 Theoretical computer science 、 Class (set theory) 、 Inductive reasoning 、 Identification (information) 、 Mathematics 、 Formal language 、 Limit (mathematics) 、 Proof calculus
摘要: A majority of studies on inductive inference formal languages and models logic programming have mainly used Gold's identification in the limit as a correct criterion. In this criterion, we can not decide general whether terminates or not, results necessarily involve some risks. paper, deal with finite for class recursive languages. The machine produces unique guess just once when it is convinced termination inference, do not. any risks at all. We present necessary sufficient conditions to be finitely identifiable from positive complete data. also classes that are
springer.com
sci-hub.st 参考文章(15)
Hans-Rainer Beick, Klaus P. Jantke, Combining Postulates of Naturalness in Inductive Inference. Journal of Automata, Languages and Combinatorics. ,vol. 17, pp. 465- 484 ,(1981)
Rolf Wiehagen, R. V. Freivald, Inductive Inference with Additional Information. Journal of Automata, Languages and Combinatorics. ,vol. 15, pp. 179- 185 ,(1979)
Ehud Y. Shapiro, Inductive Inference of Theories from Facts. Computational Logic - Essays in Honor of Alan Robinson. pp. 199- 254 ,(1991)
Dana Angluin, Finding patterns common to a set of strings Journal of Computer and System Sciences. ,vol. 21, pp. 46- 62 ,(1980) , 10.1016/0022-0000(80)90041-0
E Mark Gold, Language identification in the limit Information & Computation. ,vol. 10, pp. 447- 474 ,(1967) , 10.1016/S0019-9958(67)91165-5
Steffen Lange, Thomas Zeugmann, Types of monotonic language learning and their characterization conference on learning theory. pp. 377- 390 ,(1992) , 10.1145/130385.130427
Takeshi Shinohara, Inductive inference from positive data is powerful conference on learning theory. pp. 97- 110 ,(1990) , 10.5555/92571.92593
R. Klette, R. Wiehagen, Research in the theory of inductive inference by GDR mathematicians-A survey Information Sciences. ,vol. 22, pp. 149- 169 ,(1980) , 10.1016/S0020-0255(80)80006-5
Dana Angluin, Inductive inference of formal languages from positive data Information & Computation. ,vol. 45, pp. 117- 135 ,(1980) , 10.1016/S0019-9958(80)90285-5
Dana Angluin, Finding patterns common to a set of strings (Extended Abstract) symposium on the theory of computing. pp. 130- 141 ,(1979) , 10.1145/800135.804406