内涵亏值及二值命题逻辑中命题集合约简  

Intent Waned Values and Reduction of Proposition Set in 2-Valued Propositional Logic

作　　者：马垣[1] 

机构地区：[1]辽宁科技大学软件学院,鞍山114051

出　　处：《模式识别与人工智能》2013年第10期935-943,共9页Pattern Recognition and Artificial Intelligence

摘　　要：求命题集所有可能的约简是二值命题逻辑的一个重要课题.目前的算法都是逐一求单个约简,汇总起来得到所有可能约简.文中应用形式概念的理论,提出内涵亏值、亏值超图等思想,给出一次即可求出所有约简的算法.该算法使计算全部约简的运算次数大为减少.It is an important subject to imO all posslDte reuucuons o, a prupu^uuu ~ propositional logic. The current algorithms find single reduction one by one, and collect them to get all the possible reductions. In this paper, an algorithm for finding all the reductions at a time with the help of the formal concept theory is proposed, and the notions of intent waned values and waned values hypergraph are put forward. The proposed algorithm greatly decreases the operation times of finding all reductions.

关 键 词：二值命题逻辑 命题集约简 概念格 内涵亏值 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]