Resolution based on six lattice-valued proposition logic LP6(X)

被引：0
|
作者：
Meng, D [1 ]
Wang, XF [1 ]
Xu, Y [1 ]
Qin, KY [1 ]
机构：
[1] SW Jiaotong Univ, Intelligent Control Dev Ctr, Sichuan, Chengdu, Peoples R China
来源：
2003 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS, VOLS 1-5, CONFERENCE PROCEEDINGS | 2003年
关键词：
artificial intelligence; multi-valued logic; lattice-valued logic; automated reasoning; resolution;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Resolution-based automated reasoning theory is an important and active research field in artificial intelligence. It is used to judge the satisfiability of any logic formula. With the development of classical and non-classical logic, the resolution theory and method based on different logic system has been discussed widely and deeply. In the present paper, a new resolution principle by by using ultrafilter in LP6(X) is put for-ward. Different from existed method of resolution.. this resolution in this paper is based on ultrafilter of lattice implication algebra. In this paper, resolution principle based on any formula is discussed and soundness theorem is proved. Subsequently, algorithm of this resolution based on ultrafilter is given. Because of LP6(X) is a non-chain, non-boolean and non-well-ordered algebra structure, resolution based on LP6(X) will be the theoretical foundation of resolution on lattice-valued truth-field. Accordingly, the research in this paper will be helpful support for the application of intelligent reasoning system based on lattice-valued logic.
引用
收藏
页码：2489 / 2494
页数：6
相关论文
共 50 条
  • [1] Resolution principle based on six lattice-valued proposition logic LP6 (X)
    Meng, D
    Xu, Y
    Qiu, XP
    Qin, KY
    2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS, 2003, : 508 - 512
  • [2] α-resolution principle based on lattice-valued propositional logic LP(X)
    Xu, Y
    Ruan, D
    Kerre, EE
    Liu, J
    INFORMATION SCIENCES, 2000, 130 (1-4) : 195 - 223
  • [3] α-Satisfiability and α-Lock Resolution for a Lattice-Valued Logic LP(X)
    He, Xingxing
    Xu, Yang
    Li, Yingfang
    Liu, Jun
    Martinez, Luis
    Ruan, Da
    HYBRID ARTIFICIAL INTELLIGENCE SYSTEMS, PT 2, 2010, 6077 : 320 - +
  • [4] Filter-based resolution principle for lattice-valued propositional logic LP(X)
    Ma, Jun
    Li, Wenjiang
    Ruan, Da
    Xu, Yang
    INFORMATION SCIENCES, 2007, 177 (04) : 1046 - 1062
  • [5] IDEAL-BASED RESOLUTION PRINCIPLE FOR LATTICE-VALUED PROPOSITIONAL LOGIC LP(X)
    Xu, Weitao
    Xu, Yang
    Deng, Wenhong
    Zhong, Xiaomei
    He, Xingxing
    INTELLIGENT DECISION MAKING SYSTEMS, VOL. 2, 2010, : 601 - +
  • [6] α-MINIMAL RESOLUTION PRINCIPLE BASED ON LATTICE-VALUED PROPOSITIONAL LOGIC LP(X)
    Jia, Hairui
    Xu, Yang
    Liu, Yi
    He, Huicong
    PROCEEDINGS OF 2013 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS (ICMLC), VOLS 1-4, 2013, : 1729 - 1734
  • [7] MULTI-ARY alpha-SEMANTIC RESOLUTION AUTOMATED REASONING BASED ON A LATTICE-VALUED PROPOSITION LOGIC LP(X)
    Liu, Yi
    Jia, Hairui
    Xu, Yang
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2016, 12 (05): : 1629 - 1643
  • [8] Determination of 3-Ary α-Resolution in Lattice-valued Propositional Logic LP(X)
    Liu, Yi
    Jia, Hairui
    Xu, Yang
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2013, 6 (05): : 943 - 953
  • [9] Determination of 3-Ary α-Resolution in Lattice-valued Propositional Logic LP(X)
    Yi Liu
    Hairui Jia
    Yang Xu
    International Journal of Computational Intelligence Systems, 2013, 6 : 943 - 953
  • [10] Syntactic Extension of Lattice-valued Propositional Logic LP(X)
    ZHENG Feng-bin
    College of Sciences
    Department of Mathematics
    Intelligent Control Development Center
    数学季刊, 2006, (02) : 301 - 308
12345