General form of a-Linear Resolution Method based on Lattice-Valued First-Order Logic System
In this paper we propose a new resolution approach for automated reasoning in artificial intelligence. The general form o-linear resolution method is established in lattice-valued first-order logic system LF(X) based on lattice implication algebra. The soundness theorem is given in LF(X). By using lift lemma, the weak completeness theorem is also investigated in LFX). This method is to provide a scientific and efficient reasoning tool for theorem proving based on lattice-valued logic system.
automated reasoning lattice-valued first-order logic general form of a-linear resolution generalized clause generalized literal
Weitao Xu Wenqiang Zhang Yang Xu
College of Information Science and Engineering, Henan University of Technology, Zhengzhou 450001, Ch Department of Mathematics, Southwest Jiaotong University, Chengdu 610031, China
国际会议
杭州
英文
864-867
2012-10-28(万方平台首次上网日期,不代表论文的发表时间)