Inductive Inference and Inductive Process
-
摘要: 分析了归纳推理与演绎推理的区别, 给出了归纳推理的形式化规则,定义了重构和归纳进程(序列)的概念.同时还给出了一个产生归纳序列的归纳过程模式,并证明:若已知模型M的全体实例集合εM,则可以从任一给定的理论出发, 使用此归纳过程模式所产生的所有归纳序列都收敛于同一极限,这个极限就是模型M的全部真语句. 这说明了归纳推理规则的合理性.Abstract: This paper analyzes the difference between inductive inference and deductive inference, presents a formal logic framework for inductive inference, and defines the concepts of reconstruction and inductive sequence. In addition, it gives an inductive procedure to generate inductive sequences. It proves that for a model M, if the set εM of all its instances is known, then starts with any theory, all inductive sequences generated by the procedure will converge to the same limit, i.e., the set of all true sentences of model M. Therefore, it justifies the inductive rules.
-
Key words:
- artificial intelligence /
- mathematical logic /
- theorem proving /
- inductive inference /
- cognition process
-
1. 莫绍揆.归纳逻辑探微.哲学研究,1993,(增刊):1~27 2. 李未.一个开放的逻辑系统.中国科学(A辑),1992,35(10):1103~1113 3. Gallier J H.Logic for computer science, foundations of automatic theorem proving. Singapore:John Wiley & Sons,1987 4. Chang C C,Keisler H J. Model Theory. Amsterdam:North-Holland, 1990 5. Paulson L. Logic and computations. Cambridge:Cambridge University Press, 1987 6. Flew A. A dictionary of philosophy.London:Pan Books Ltd, 1979 7. Alchourron C E, Gardenfors R, Makinson D. On the logic of theory change:partial meet contraction and revision functions. The Journal of Symbolic Logic, 1985,50(2):510~530 8. Li W. A logical framework for evolution of specifications, Programming Languages and Systems.In:Lecture Notes in Computer Science 788. Berlin:Sringer-Verlag,1994.394~408
点击查看大图
计量
- 文章访问数: 3232
- HTML全文浏览量: 160
- PDF下载量: 903
- 被引次数: 0