部分四值逻辑中保二元正则可离关系最小覆盖之确定  

The Decision of Minimal Covering of Preserving Binary Relations of Regularly Separable in Partial Four-valued Logic

作　　者：龚志伟[1] 刘任任[2] 王日中[3] 

机构地区：[1]中南林业科技大学理学院,湖南长沙410004 [2]湘潭大学信息与工程学院,湖南湘潭411105 [3]中南大学信息科学与工程学院,湖南长沙410083

出　　处：《计算技术与自动化》2007年第4期49-52,共4页Computing Technology and Automation

基　　金：国家自然科学基金资助项目(60083001);湖南省自然科学基金资助项目(03JJY3099)

摘　　要：根据部分K值逻辑的完备性理论、正则可离关系、相似关系的概念,构造同源关系的概念。对部分四值逻辑中最小覆盖的确定进行分析。首先,总结部分四值逻辑中,对于正则可离函数集共有129个准完各集不可剔除;然后,对保二元的48个正则可离函数集按相似关系分为9类;最后,证明这9类保二元正则可离函数集是最小覆盖成员。According to the completeness theory in partial k- valued logic, regularly separable relation and resemble relation, the same source relation is constructed. And the decision of minimal covering in partial four-valued logic is analyzed. Firstly, it found out 129 precomplete sets for regularly separable functions in pcortial four- valued logic. Secondly, it categorized 48 preserving binary regularly separable fimctions into 9 classes by means of the similar relation. Finally, it proved that these 9 classes were the minimal covering components.

关 键 词：多值逻辑 SHEFFER函数 正则可离关系 最小覆盖 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]