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 条
  • [41] 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 - +
  • [42] α-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,
  • [43] 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
  • [44] Closure Operators of Lattice-valued Propositional Logic LP(X)
    WANG Xue-fang
    College of Computer and Information Engineering
    .Intelligent Control Development Center
    数学季刊, 2005, (03) : 301 - 308
  • [45] L-TAUTOLOGY THEORY IN LATTICE-VALUED PROPOSITIONAL LOGIC
    Pan, Xiaodong
    Xu, Kaijun
    Qin, Keyun
    Xu, Yang
    COMPUTATIONAL INTELLIGENCE: FOUNDATIONS AND APPLICATIONS: PROCEEDINGS OF THE 9TH INTERNATIONAL FLINS CONFERENCE, 2010, 4 : 105 - +
  • [46] The Syntax of Lattice-Valued Propositional Logic System lp(X)
    李华
    Journal of Donghua University(English Edition), 2007, (02) : 305 - 308
  • [47] Lattice-Valued Truth Degree in Lukasiewicz Propositional Fuzzy Logic
    Zhang, Dong-xiao
    QUANTITATIVE LOGIC AND SOFT COMPUTING 2010, VOL 2, 2010, 82 : 331 - 337
  • [48] Valuation sets in lattice-valued propositional logic LP(X)
    Wang, XF
    Qing, M
    PROCEEDINGS OF THE 12TH IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1 AND 2, 2003, : 114 - 119
  • [49] α-Minimal Resolution Principle For A Lattice-Valued Logic
    Jia, Hairui
    Xu, Yang
    Liu, Yi
    Liu, Jun
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2015, 8 (01) : 34 - 43
  • [50] Multiary α-Resolution Principle for a Lattice-Valued Logic
    Xu, Yang
    Liu, Jun
    Zhong, Xiaomei
    Chen, Shuwei
    IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2013, 21 (05) : 898 - 912
12345