On minimization of axiom sets characterizing covering-based approximation operators |
| |
Authors: | Yan-Lan Zhang Mao-Kang Luo |
| |
Affiliation: | a Department of Computer Sciences and Engineering, Zhangzhou Normal University, Zhang’zhou, Fu’jian 363000, PR China b College of Mathematics, Sichuan University, Cheng’du, Si’chuan 610064, PR China |
| |
Abstract: | Rough set theory was proposed by Pawlak to deal with the vagueness and granularity in information systems. The classical relation-based Pawlak rough set theory has been extended to covering-based generalized rough set theory. The rough set axiom system is the foundation of the covering-based generalized rough set theory, because the axiomatic characterizations of covering-based approximation operators guarantee the existence of coverings reproducing the operators. In this paper, the equivalent characterizations for the independent axiom sets of four types of covering-based generalized rough sets are investigated, and more refined axiom sets are presented. |
| |
Keywords: | Axioms Covering-based approximation operators Covering-based generalized rough sets Rough sets Minimization |
本文献已被 ScienceDirect 等数据库收录! |
|