Abstract: Adopting Zakowski-s upper approximation operator
C and lower approximation operator C, this paper investigates
granularity-wise separations in covering approximation spaces. Some
characterizations of granularity-wise separations are obtained by
means of Pawlak rough sets and some relations among granularitywise
separations are established, which makes it possible to research
covering approximation spaces by logical methods and mathematical
methods in computer science. Results of this paper give further
applications of Pawlak rough set theory in pattern recognition and
artificial intelligence.
Abstract: This paper shows that some properties of the decision
rules in the literature do not hold by presenting a counterexample. We
give sufficient and necessary conditions under which these properties
are valid. These results will be helpful when one tries to choose the
right decision rules in the research of rough set theory.
Abstract: Let (U;D) be a Gr-covering approximation space
(U; C) with covering lower approximation operator D and covering
upper approximation operator D. For a subset X of U, this paper
investigates the following three conditions: (1) X is a definable subset
of (U;D); (2) X is an inner definable subset of (U;D); (3) X is an
outer definable subset of (U;D). It is proved that if one of the above
three conditions holds, then the others hold. These results give a
positive answer of an open problem for definable subsets of covering
approximation spaces.