Rough set approximations of Pawlak [15] are sometimes generalized by using similarities between objects rather than elementary sets. In practical applications, both knowledge about properties of objects and knowledge of similarity between objects can be incomplete and inconsistent. The aim of this paper is to define set approximations when all sets, and their approximations, as well as similarity relations are four-valued. A set is four-valued in the sense that its membership function can have one of the four logical values: unknown (u), false (f), inconsistent (i), or true (t). To this end, a new implication operator and set-theoretical operations on four-valued sets, such as set containment, are introduced. Several properties of lower and upper approximations of four-valued sets are also presented. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Vitória, A., Szałas, A., & Małuszyński, J. (2008). Four-valued extension of rough sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5009 LNAI, pp. 106–114). https://doi.org/10.1007/978-3-540-79721-0_19
Mendeley helps you to discover research relevant for your work.