摘要
论文定义知识表达系统的不可分辨矩阵,并且揭示如何通过不可分辨矩阵解决与知识表达系统三大属性简化相关的问题,包括判断一个属性是否在核中,判断一个对象是否在正区中,判断决策表是否协调,如何将知识表达系统属性简化、决策表条件属性简化、协调决策表条件属性简化问题转化为生成集族的Ⅱ型极小子集问题。
The paper defines two new concepts, including type Ⅰ teeny subset and type Ⅱ teeny subset related to a subset family. Then it reveals that how the two problems are converted to one another. And it discovers the relation between the family consisting of all type Ⅰ teeny subsets and type Ⅰ core, and the relation between the family consisting of all type Ⅱ teeny subsets and type Ⅱ core. It also describes a greedy method to produce an approximate type Ⅰ teeny subset and a power tree method to produce all the type Ⅰ teeny subsets.
出处
《计算机科学》
CSCD
北大核心
2004年第2期9-10,25,共3页
Computer Science
基金
自然科学基金(79970025)
