模式识别与人工智能
模式識彆與人工智能
모식식별여인공지능
Moshi Shibie yu Rengong Zhineng
2013年
10期
935-943
,共9页
二值命题逻辑%命题集约简%概念格%内涵亏值
二值命題邏輯%命題集約簡%概唸格%內涵虧值
이치명제라집%명제집약간%개념격%내함우치
2-Valued Propositional Logic%Reduction of Proposition Set%Concept Lattice%Intent Waned Value
求命题集所有可能的约简是二值命题逻辑的一个重要课题。目前的算法都是逐一求单个约简，汇总起来得到所有可能约简。文中应用形式概念的理论，提出内涵亏值、亏值超图等思想，给出一次即可求出所有约简的算法。该算法使计算全部约简的运算次数大为减少。
求命題集所有可能的約簡是二值命題邏輯的一箇重要課題。目前的算法都是逐一求單箇約簡，彙總起來得到所有可能約簡。文中應用形式概唸的理論，提齣內涵虧值、虧值超圖等思想，給齣一次即可求齣所有約簡的算法。該算法使計算全部約簡的運算次數大為減少。
구명제집소유가능적약간시이치명제라집적일개중요과제。목전적산법도시축일구단개약간，회총기래득도소유가능약간。문중응용형식개념적이론，제출내함우치、우치초도등사상，급출일차즉가구출소유약간적산법。해산법사계산전부약간적운산차수대위감소。
It is an important subject to find all possible reductions of a proposition set in the two-valued 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.
