知识的交派生及其算法  

Meet-generating of Knowledge and Its Algorism

作　　者：赵静[1] 徐罗山[1] 

机构地区：[1]扬州大学数学科学学院,江苏扬州225002

出　　处：《模糊系统与数学》2014年第3期160-164,共5页Fuzzy Systems and Mathematics

基　　金：国家自然科学基金资助项目(61074129;61103018;11101352);江苏省自然科学基金资助项目(BK2010313;BK2011442);国家重点实验室开放课题(SKLSDE-2011KF-08)

摘　　要：对论域U上一般知识引入了知识交派生概念,研究了知识交派生集族的性质,证明了在论域U有限且给定知识对并关闭时,知识交派生集族形成一个拓扑。举例说明了论域U无穷且知识对任意并关闭时,其有限交派生集族不必形成一个拓扑。我们还给出了有穷论域上知识交派生的有效算法,证明了这种算法确实给出了交派生集族。For a universe U, we PrOPosed the concept of meet-generating of knowledge. We also studied properties of meet-generating of knowledge. It is proved that when U is a finite unverse and a given family of sets on U is closed w. r. t unions, then the meet-generating of the family forms a topology on U. A counterexample is given to show that if U is infinite, then the meet-generating of a family needn＇ t be a topology generally. An effective algorism is constructed to compute the meet-generating of a family on a finite universe. It is proved that the algorism indeed computes the meet-generating.

关 键 词：粗糙集 知识 交派生 算法 

分 类 号：O159[理学—数学]