| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 396420 | Information Sciences | 2006 | 13 Pages |
Abstract
In the axiomatic approach of rough set theory, rough approximation operators are characterized by a set of axioms that guarantees the existence of certain types of binary relations reproducing the operators. Thus axiomatic characterization of rough approximation operators is an important aspect in the study of rough set theory. In this paper, the independence of axioms of generalized crisp approximation operators is investigated, and their minimal sets of axioms are presented.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Xiao-Ping Yang, Tong-Jun Li,