Vitoria, Aida Szalas, Andrzej Maluszynski, Jan 2008 (English)In: Proceedings of the 3rd International Conference Rough Sets and Knowledge Technology (RSKT), Springer, 2008, 106-114Konferensbidrag (Refereed)
Rough set approximations of Pawlak  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.
Lecture Notes in Computer Science, ISSN 0302-9743 ; 5009
National CategoryEngineering and Technology
Identifiersurn:nbn:se:liu:diva-43561 (URN)10.1007/978-3-540-79721-0_19 (DOI)74200 (Local ID)978-3-540-79720-3 (ISBN)oai:DiVA.org:liu-43561 (OAI)