首页 | 本学科首页   官方微博 | 高级检索  
     

计算约简的差别矩阵简化算法不成立
引用本文:庞彦军,刘开第. 计算约简的差别矩阵简化算法不成立[J]. 系统工程理论与实践, 2004, 24(2): 142-144. DOI: 10.12011/1000-6788(2004)2-142
作者姓名:庞彦军  刘开第
作者单位:河北建筑科技学院数理系
基金项目:国家自然科学基金(60075013),河北省自然科学基金(601312)
摘    要:Skowron差别矩阵给出了粗集约简的一般方法,但该算法要求生成、存储差别矩阵的中间环节,造成时间和空间上的浪费.实际应用中给出一种简化算法:一边从信息表中提取差别元素构成合取范式,一边用分配律、吸收律作逻辑公式的等价变换,直接得到最小析取范式.本章给出反例,说明该简化算法不总成立.

关 键 词:粗集  差别矩阵  合取范式  析取范式   
文章编号:1000-6788(2004)02-0142-03
修稿时间:2003-03-03

The Simplify Algorithm of Calculating the Reduced Differential Matrix Is Untenable
PANG Yan-jun,LIU Kai-di. The Simplify Algorithm of Calculating the Reduced Differential Matrix Is Untenable[J]. Systems Engineering —Theory & Practice, 2004, 24(2): 142-144. DOI: 10.12011/1000-6788(2004)2-142
Authors:PANG Yan-jun  LIU Kai-di
Affiliation:Hebei Institute of Architectural Science and Technology
Abstract:Skowron's differential matrix theory makes the reduce processes of rough set more simple. But the shortness of this method is that it requires that the intermediate links of the differential matrix is produced and stored, which creates wastes on time and space. A simplified method is given in practice: on the one side, it extracts the differential elements to construct conjunctive normal form from the information table. On the other side, it uses distribution law and absorption law as the equivalence transformation of the logical formula to get the minimum disjunctive normal forms directly. This paper gives the anti-examples to show that the simplify algorithm is untenable.
Keywords:rough set  differential matrix  conjunctive normal form  disjunctive normal form  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《系统工程理论与实践》浏览原始摘要信息
点击此处可从《系统工程理论与实践》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号