Back to Search Start Over

Bilattice Logic for Rough Sets.

Authors :
Nakayama, Yotaro
Akama, Seiki
Murai, Tetsuya
Source :
Journal of Advanced Computational Intelligence & Intelligent Informatics. Nov2020, Vol. 24 Issue 6, p774-784. 11p.
Publication Year :
2020

Abstract

Rough set theory is studied to manage uncertain and inconsistent information. Because Pawlak's decision logic for rough sets is based on the classical two-valued logic, it is inconvenient for handling inconsistent information. We propose a bilattice logic as the deduction basis for the decision logic of rough sets to address inconsistent and ambiguous information. To enhance the decision logic to bilattice semantics, we introduce Variable Precision Rough Set (VPRS). As a deductive basis for bilattice decision logic, we define a consequence relation for Belnap's four-valued semantics and provide a bilattice semantic tableau TB4 for a deduction system. We demonstrate the soundness and completeness of TB4 and enhance it with weak negation. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
13430130
Volume :
24
Issue :
6
Database :
Academic Search Index
Journal :
Journal of Advanced Computational Intelligence & Intelligent Informatics
Publication Type :
Academic Journal
Accession number :
147111309
Full Text :
https://doi.org/10.20965/jaciii.2020.p0774