J4 ›› 2014, Vol. 41 ›› Issue (1): 135-139.doi: 10.3969/j.issn.1001-2400.2014.01.024

• Original Articles • Previous Articles     Next Articles

α-generalized resolution principle based on the lattice-valued first-order logic system

XU Weitao1;ZHANG Wenqiang1;XU Yang2;ZHANG Dexian1   

  1. (1. College of Information Science and Engineering, Henan Univ. of Technology, Zhengzhou  450001, China;
    2. School of Mathematics, Southwest Jiaotong Univ., Chengdu  610031, China)
  • Received:2012-11-08 Online:2014-02-20 Published:2014-04-02
  • Contact: XU Weitao E-mail:hnxmxwt@163.com

Abstract:

In the framework of the lattice-valued logic system based on the lattice implication algebra, the α-resolution principle based on the lattice-valued logic system is extended from generalized clauses set to general generalized clauses set. In this paper, the α-generalized resolution principle is presented in the lattice-valued first-order logic system LF(X). At the same time, the soundness theorem is established in LF(X). By using the lift lemma, the weak completeness theorem is also proved. This work can provide a new automated reasoning technology in order to establish novel generalized resolution methods for lattice-valued logic systems.

Key words: lattice-valued first-order logic, general generalized clause, local extremely complex generalized literal, generalized resolution, automated reasoning