抽象知识库的M-区分矩阵与交约简求法  

M-discernibility Matrix and Methods to Get Meet Reductions for Abstract Knowledge Bases

作　　者：吴国俊 徐罗山[1] WU Guo-jun;XU Luo-shan(College of Mathematical Sciences,Yangzhou University,Yangzhou 225002,China)

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

出　　处：《模糊系统与数学》2022年第5期151-157,共7页Fuzzy Systems and Mathematics

基　　金：国家自然科学基金资助项目(11671008);江苏高校品牌专业建设工程项目(PPZY2015B109)。

摘　　要：抽象知识库作为覆盖粗糙集与知识库的推广。本文研究了抽象知识库的交约简与核。由于现存文献中的区分矩阵不能用来获得求抽象知识库约简的判定定理,本文引入了M-区分矩阵。利用M-区分矩阵及相应的M-区分函数研究了抽象知识库的交约简与核,给出了基于M-区分函数的极小析取范式交约简的求法,并通过赋值法对该求法的正确性进行了严格证明,以此建立了这类基于极小析取范式约简求法的理论和逻辑基础。knowledge bases are generalizations of covering rough sets and knowledge bases.In this paper,meet reductions and cores of abstract knowledge bases are studied.Since discernibility matrixes in known papers can not obtain criterion theorems for meet reductions of abstract knowledge bases,M-discernibility matrix is introduced for abstract knowledge bases in this paper.Meet reductions and cores of abstract knowledge bases are studied by using M-discernibility matrix and the related M-discernibility functions.Methods to get meet reductions for abstract knowledge bases are presented and proved based on minimal disjunctive normal forms of M-discernibility functions.In this way,the theoretic and logic base is established for getting reductions of various(abstract)knowledge bases.

关 键 词：抽象知识库 覆盖粗糙集 M-区分矩阵 交约简 核 

分 类 号：O153[理学—数学] O189[理学—基础数学]