liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Four-valued Extension of Rough Sets
2008 (English)In: Proceedings of the 3rd International Conference Rough Sets and Knowledge Technology (RSKT), Springer, 2008, 106-114Conference paper (Refereed)
Abstract [en]

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.

Lecture Notes in Computer Science, ISSN 0302-9743 ; 5009
National Category
Engineering and Technology
URN: urn:nbn:se:liu:diva-43561DOI: 10.1007/978-3-540-79721-0_19Local ID: 74200ISBN: 978-3-540-79720-3OAI: diva2:264421
Available from2009-10-10 Created:2009-10-10 Last updated:2011-03-04

Open Access in DiVA

No full text

Other links

Publisher's full text

Search in DiVA

By author/editor
Vitoria, AidaSzalas, AndrzejMaluszynski, Jan
By organisation
Visual Information Technology and Applications (VITA)The Institute of TechnologyKPLAB - Knowledge Processing LabTCSLAB - Theoretical Computer Science Laboratory
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 87 hits
ReferencesLink to record
Permanent link

Direct link