α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems

被引：3
|
作者：
Xu, Weitao [1 ]
Zhang, Wenqiang [1 ]
Zhang, Dexian [1 ]
Xu, Yang [2 ]
Pan, Xiaodong [2 ]
机构：
[1] Henan Univ Technol, Coll Informat Sci & Engn, Zhengzhou 450001, Peoples R China
[2] Southwest Jiaotong Univ, Sch Math, Chengdu 610031, Peoples R China
来源：
INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS | 2015年 / 8卷
基金：
中国国家自然科学基金; 国家高技术研究发展计划(863计划);
关键词：
automated reasoning; lattice-valued logic; alpha-resolution; lattice-valued Horn g-clause; lattice implication algebra;
D O I：
10.1080/18756891.2015.1129580
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, an -resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic system L P(X ) based on lattice implication algebra. Firstly, the notions of lattice-valued Horn generalized clause, normal lattice-valued Horn generalized clause and unit lattice-valued Horn generalized clause are given in L P(X ). Then, the -resolution of two lattice-valued Horn generalized clauses is represented in L P(X ). It indicates the reasoning rules in a resolution process, which aims at deleting -resolution literals and obtaining a resolvent. Finally, we build an -resolution algorithm for a set of lattice-valued Horn generalized clauses in L P(X ). It provides a foundation for automated reasoning in lattice-valued first-order logic system and an application for designing an inference system in the field of intelligent decision support.
引用
收藏
页码：75 / 84
页数：10
相关论文
共 50 条
  • [41] 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
  • [42] Connectedness for lattice-valued subsets in lattice-valued convergence spaces
    Jin, Qiu
    Li, Lingqiang
    Lv, Yanrui
    Zhao, Fangfang
    Zou, Juan
    QUAESTIONES MATHEMATICAE, 2019, 42 (02) : 135 - 150
  • [43] Tautologies in some lattice-valued logic systems
    Li, HM
    Qin, KY
    Xu, Y
    2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS, 2003, : 2563 - 2568
  • [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] α-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
  • [47] The Syntax of Lattice-Valued Propositional Logic System lp(X)
    李华
    Journal of Donghua University(English Edition), 2007, (02) : 305 - 308
  • [48] Lattice-Valued Truth Degree in Lukasiewicz Propositional Fuzzy Logic
    Zhang, Dong-xiao
    QUANTITATIVE LOGIC AND SOFT COMPUTING 2010, VOL 2, 2010, 82 : 331 - 337
  • [49] 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
  • [50] α-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
12345