General Form of a-Ordered Linear Resolution Method for Lattice-Valued Logic System with Linguistic Truth-Values

被引:0
|
作者
Xu, Weitao [1 ]
Xu, Yang [2 ]
机构
[1] Henan Univ Technol, Coll Informat Sci & Engn, Zhengzhou 450001, Peoples R China
[2] Southwest Jiaotong Univ, Dept Maths, Chengdu 610031, Peoples R China
基金
中国国家自然科学基金;
关键词
automated reasoning; linguistic truth-valued lattice-valued logic system; ordered linear resolution; generalized literal; generalized clause;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the present paper, general form of alpha-ordered linear resolution method IS established m lattice-valued logic system with linguistic truth-values. Firstly, general form of alpha-ordered linear resolution method is investigated in linguistics truth-valued lattice-valued propositional logic system based on linguistics truth-valued lattice implication algebra. It can obtain a resolvent under a linguistic truth-valued level for a set of generalized clauses. Both soundness and weak completeness theorems are established. Then, general form of alpha-ordered linear resolution method IS established in linguistics truth-valued lattice-valued first-order logic system. The soundness theorem is also given. Finally, By using lift lemma, the weak completeness theorem is also obtained. This method provides a new resolution approach for automated reasoning based on lattice-valued logic system.
引用
收藏
页数:7
相关论文
共 50 条
  • [1] General form of α-resolution principle for linguistic truth-valued lattice-valued logic
    Zhong, Xiaomei
    Xu, Yang
    Liu, Jun
    Chen, Shuwei
    SOFT COMPUTING, 2012, 16 (10) : 1767 - 1781
  • [2] General form of α-resolution principle for linguistic truth-valued lattice-valued logic
    Xiaomei Zhong
    Yang Xu
    Jun Liu
    Shuwei Chen
    Soft Computing, 2012, 16 : 1767 - 1781
  • [3] On compatibilities of α-lock resolution method in linguistic truth-valued lattice-valued logic
    He, Xingxing
    Xu, Yang
    Liu, Jun
    Chen, Shuwei
    SOFT COMPUTING, 2012, 16 (04) : 699 - 709
  • [4] α-Generalized lock resolution method in linguistic truth-valued lattice-valued logic
    He, Xingxing
    Xu, Yang
    Liu, Jun
    Chen, Shuwei
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2012, 5 (06): : 1120 - 1134
  • [5] α-Generalized lock resolution method in linguistic truth-valued lattice-valued logic
    Xingxing He
    Yang Xu
    Jun Liu
    Shuwei Chen
    International Journal of Computational Intelligence Systems, 2012, 5 : 1120 - 1134
  • [6] On compatibilities of α-lock resolution method in linguistic truth-valued lattice-valued logic
    Xingxing He
    Yang Xu
    Jun Liu
    Shuwei Chen
    Soft Computing, 2012, 16 : 699 - 709
  • [7] α-generalized Resolution Method Based on Linguistic Truth-valued Lattice-valued Propositional Logic System
    Xu, Weitao
    2017 12TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS AND KNOWLEDGE ENGINEERING (IEEE ISKE), 2017,
  • [8] GENERAL FORM OF α-LINEAR RESOLUTION METHOD BASED ON LATTICE-VALUED PROPOSITIONAL LOGIC SYSTEM LP(X)
    Xu, Weitao
    Zhang, Dexian
    Zhu, Hua
    Xu, Yang
    UNCERTAINTY MODELING IN KNOWLEDGE ENGINEERING AND DECISION MAKING, 2012, 7 : 720 - 725
  • [9] General form of α-Linear Resolution Method based on Lattice-Valued First-Order Logic System
    Xu, Weitao
    Zhang, Wenqiang
    Xu, Yang
    2012 FIFTH INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN (ISCID 2012), VOL 2, 2012, : 286 - 289
  • [10] α-ORDERED LINEAR MINIMAL RESOLUTION METHOD IN LATTICE-VALUED PROPOSITIONAL LOGIC SYSTEM LP(X)
    Jia, Hairui
    Fie, Huicong
    Xu, Yang
    Liu, Yi
    DECISION MAKING AND SOFT COMPUTING, 2014, 9 : 191 - 196