格值命题逻辑系统L9P（X）中的自动推理算法

计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (10): 6-9.

格值命题逻辑系统L₉P（X）中的自动推理算法

李晓冰¹,邱小平²,徐扬¹

1.西南交通大学智能控制开发中心，成都 610031
2.西南交通大学物流学院，成都 610031

收稿日期:2007-11-19 修回日期:2008-01-09 出版日期:2008-04-01 发布日期:2008-04-01
通讯作者: 李晓冰

Automated reasoning algorithm of lattice-valued propositional logic L₉P（X）

LI Xiao-bing¹,QIU Xiao-ping²,XU Yang¹

1.Intelligent Control Development Center，Southwest Jiaotong University，Chengdu 610031，China
2.College of Logistics，Southwest Jiaotong University，Chengdu 610031，China

Received:2007-11-19 Revised:2008-01-09 Online:2008-04-01 Published:2008-04-01
Contact: LI Xiao-bing

摘要/Abstract

摘要： 给出了格值命题逻辑系统L₉P（X）上的放缩原理和放缩归结原理，基于放缩归结原理，给出了一种判断L₉P（X）上子句集S为M－可满足的自动推理算法（这里M为L₉上的中界元），并证明了其可靠性和完备性。

关键词: 中界元, 格值命题逻辑系统, 归结自动推理, 放缩归结原理, 自动推理算法

Abstract: In this paper，magnifying or reducing principle and magnifying or reducing resolution principle of lattice-valued propositional logic L₉P（X） are given.Based on the magnifying or reducing resolution principle，an automated reasoning algorithm is given which can be used to decide if a clause set S is M－satisfiable，where M is an intermediate element of L₉，and its soundness and completeness are proved.

Key words: intermediate element, lattice-valued propositional logic, automated reasoning based on resolution, magnifying or reducing resolution principle, automated reasoning algorithm

李晓冰¹,邱小平²,徐扬¹. 格值命题逻辑系统L₉P（X）中的自动推理算法[J]. 计算机工程与应用, 2008, 44(10): 6-9.

LI Xiao-bing¹,QIU Xiao-ping²,XU Yang¹. Automated reasoning algorithm of lattice-valued propositional logic L₉P（X）[J]. Computer Engineering and Applications, 2008, 44(10): 6-9.

格值命题逻辑系统L₉P（X）中的自动推理算法

Automated reasoning algorithm of lattice-valued propositional logic L₉P（X）

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 0

编辑推荐

Metrics