The Ordered Set of Rough Sets
We study the ordered set of rough sets determined by relations which are not necessarily reflexive, symmetric, or transitive. We show that for tolerances and transitive binary relations the set of rough sets is not necessarily even a semilattice. We also prove that the set of rough sets determined by a symmetric and transitive binary relation forms a complete Stone lattice. Furthermore, for the ordered sets of rough sets that are not necessarily lattices we present some possible canonical completions.
Unable to display preview. Download preview PDF.
- Cattaneo, G.: Abstract Approximation Spaces for Rough Theories. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery I, pp. 59–98. Physica, Heidelberg (1998)Google Scholar
- Yao, Y.Y., Lin, T.Y.: Generalization of Rough Sets using Modal Logics. Intelligent Automation and Soft Computing. An International Journal 2, 103–120 (1996)Google Scholar