On α-satisfiability and its α-lock resolution in a finite lattice-valued propositional logic

被引：14
|
作者：
He, Xingxing [1 ]
Liu, Jun [2 ]
Xu, Yang [1 ]
Martinez, Luis [3 ]
Ruan, Da [4 ,5 ]
机构：
[1] SW Jiaotong Univ, Intelligent Control Dev Ctr, Chengdu 610031, Sichuan, Peoples R China
[2] Univ Ulster, Sch Comp & Math, Coleraine BT52 1SA, Londonderry, North Ireland
[3] Univ Jaen, Dept Comp, E-23071 Jaen, Spain
[4] Univ Ghent, B-9000 Ghent, Belgium
[5] Belgian Nucl Res Ctr SCK CEN, B-2400 Mol, Belgium
来源：
LOGIC JOURNAL OF THE IGPL | 2012年 / 20卷 / 03期
基金：
中国国家自然科学基金;
关键词：
Lattice-valued logic; alpha-resolution principle; alpha-satisfiability; alpha-lock resolution method; finite lattice-valued propositional logic; PRINCIPLE; LP(X);
D O I：
10.1093/jigpal/jzr007
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Automated reasoning issues are addressed for a finite lattice-valued propositional logic LnP(X) with truth-values in a finite lattice-valued logical algebraic structure-lattice implication algebra. We investigate extended strategies and rules from classical logic to LnP(X) to simplify the procedure in the semantic level for testing the satisfiability of formulas in LnP(X) at a certain truth-value level alpha (alpha-satisfiability) while keeping the role of truth constant formula played in LnP(X). We propose a lock resolution method at a certain truth-value level alpha (alpha-lock resolution) in LnP(X) and have proved its theorems of soundness and weak completeness, respectively. We provide more efficient resolution based automated reasoning in LnP(X) and key supports for alpha-resolution-based automated reasoning approaches and algorithms in lattice based linguistic truth-valued logic.
引用
收藏
页码：579 / 588
页数：10
相关论文
共 50 条
  • [31] Semantics of lattice-valued tense propositional logic system
    Li, Wen-Jiang
    Xu, Yang
    Xinan Jiaotong Daxue Xuebao/Journal of Southwest Jiaotong University, 2004, 39 (05): : 691 - 695
  • [32] α-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
  • [33] α - GENERALIZED RESOLUTION PRINCIPLE BASED ON LATTICE-VALUED PROPOSITIONAL LOGIC LP(X)
    Xu, Yang
    Xu, Weitao
    Zhong, Xiaomei
    He, Xingxing
    COMPUTATIONAL INTELLIGENCE: FOUNDATIONS AND APPLICATIONS: PROCEEDINGS OF THE 9TH INTERNATIONAL FLINS CONFERENCE, 2010, 4 : 66 - 71
  • [34] A new lattice-valued propositional logic (I): Semantics
    Qin, KY
    Xu, Y
    COMPUTATIONAL INTELLIGENT SYSTEMS FOR APPLIED RESEARCH, 2002, : 44 - 49
  • [35] α-Quasi-Lock Semantic Resolution Method Based on Lattice-Valued Logic
    Xiaomei Zhong
    Yang Xu
    Jun Liu
    Shuwei Chen
    International Journal of Computational Intelligence Systems, 2014, 7 : 418 - 431
  • [36] α-Quasi-Lock Semantic Resolution Method Based on Lattice-Valued Logic
    Zhong, Xiaomei
    Xu, Yang
    Liu, Jun
    Chen, Shuwei
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2014, 7 (03) : 418 - 431
  • [37] 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
  • [38] 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
  • [39] 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
  • [40] NON-CLAUSAL α-MINIMAL GENERALIZED RESOLUTION PRINCIPLE FOR LATTICE-VALUED PROPOSITIONAL LOGIC
    Jia, Hairui
    Du, Limin
    Xu, Yang
    UNCERTAINTY MODELLING IN KNOWLEDGE ENGINEERING AND DECISION MAKING, 2016, 10 : 465 - 470
12345