On finding core and reduction in rough set theory
Tang Jian-guo · Kongzhi yu juece · 2003
Reduction and core are two important concepts in rough set theory, while computing reductions and core according to the definitions directly is a typical NP problem. A number of useful natures of the discernable matrix is discovered, and used to solve the NP problem. The problems of reducing systems with and without decision are discussed respectively. The effectiveness of the result obtained is demonstrated by an example.