We show that [Lemma 3.3, p. 538] which was introduced in [1] is incorrect in general, by giving counter examples. Consequently, [Proposition 3.2, p. 539] is also incorrect. Moreover, the correction form of the incorrect results in [1] is presented. Keywords: Rough set, Covering, Lower and upper approximations, MSC: 54A05, 03E20, 54G2
We correct a mistake in the proof of [2, Theorem 1.1] and a proof of the main result in [2] is prese...
This paper presents the concept of lower and upper rough matroids based on approximation operators f...
WOS: 000464544500007Rough set theory proposes a new mathematical approach to model vagueness. In thi...
Many different proposals exist for the definition of lower and upper approximation operators in cove...
In this paper, we present the covering rough sets based on neighborhoods by approximation operations...
AbstractRough set theory, a mathematical tool to deal with inexact or uncertain knowledge in informa...
Covering-based rough sets is an extension of rough sets and it is based on a covering instead of a p...
The core purpose of this paper is to point out some erroneous assertions given in the previous paper...
AbstractIn this note, we show by examples that Theorem 5.3, partial proof of Theorem 5.3′, Lemma 5.4...
Covering approximation spaces is a class of important generalization of approximation spaces. For a ...
Adopting Zakowski-s upper approximation operator C and lower approximation operator C, this paper in...
AbstractThe covering generalized rough sets are an improvement of traditional rough set model to dea...
Let (U;D) be a Gr-covering approximation space (U; C) with covering lower approximation operator D a...
AbstractIn this paper a generalized notion of an approximation space is considered. By an approximat...
AbstractRough set theory is an important technique in knowledge discovery in databases. In covering-...
We correct a mistake in the proof of [2, Theorem 1.1] and a proof of the main result in [2] is prese...
This paper presents the concept of lower and upper rough matroids based on approximation operators f...
WOS: 000464544500007Rough set theory proposes a new mathematical approach to model vagueness. In thi...
Many different proposals exist for the definition of lower and upper approximation operators in cove...
In this paper, we present the covering rough sets based on neighborhoods by approximation operations...
AbstractRough set theory, a mathematical tool to deal with inexact or uncertain knowledge in informa...
Covering-based rough sets is an extension of rough sets and it is based on a covering instead of a p...
The core purpose of this paper is to point out some erroneous assertions given in the previous paper...
AbstractIn this note, we show by examples that Theorem 5.3, partial proof of Theorem 5.3′, Lemma 5.4...
Covering approximation spaces is a class of important generalization of approximation spaces. For a ...
Adopting Zakowski-s upper approximation operator C and lower approximation operator C, this paper in...
AbstractThe covering generalized rough sets are an improvement of traditional rough set model to dea...
Let (U;D) be a Gr-covering approximation space (U; C) with covering lower approximation operator D a...
AbstractIn this paper a generalized notion of an approximation space is considered. By an approximat...
AbstractRough set theory is an important technique in knowledge discovery in databases. In covering-...
We correct a mistake in the proof of [2, Theorem 1.1] and a proof of the main result in [2] is prese...
This paper presents the concept of lower and upper rough matroids based on approximation operators f...
WOS: 000464544500007Rough set theory proposes a new mathematical approach to model vagueness. In thi...
DOI
Add to ORKG