| 极小子集问题的逻辑代数解法 |
| |
| 引用本文： | 李小霞. 极小子集问题的逻辑代数解法[J]. 计算机科学, 2006, 33(3): 145-146 |
| |
| 作者姓名： | 李小霞 |
| |
| 作者单位： | 中山大学信息科学与技术学院,广州,510275 |
| |
| 摘 要： | 在粗集论中，决策表简化问题可转化为极小子集问题.本文给出极小子集问题的逻辑代数解法，即通过求逻辑函数的极小析取范式或极小合取范式来获得极小子集.
|
| 关 键 词： | 粗集论 极小子集 极小析取范式 极小合取范式 |
Logic Algebra Method to Find Minimal Subsets |
| |
| LI Xiao-Xia. Logic Algebra Method to Find Minimal Subsets[J]. Computer Science, 2006, 33(3): 145-146 |
| |
| Authors: | LI Xiao-Xia |
| |
| Affiliation: | College of Information Science and Technology, SUN Yat-sen University, Guangdong 510275 |
| |
| Abstract: | Within rough sets theory, the reduct problems about a decision table can be settled by solving the problem of finding the minimal subsets. This paper presents an approach to settle the latter problem-the minimal subsets can be found out in the minimal disjunctive form or the minimal conjunctive form of a logical function. |
| |
| Keywords: | Rough sets theory Minimal subset Minimal disjunctive form Minimal conjunctive form |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
