Modeling and Reasoning with Paraconsistent Rough Sets

  • Authors:

  • Aida Vitória;Jan Małuszyński;Andrzej Szałas

  • Affiliations:

  • Department of Science and Technology, Linköping University, S 601 74 Norrköoping, Sweden. E-mail: aidvi@itn.liu.se;The College of Economics and Computer Science, 10-061 Olsztyn, Poland. E-mail: janma@ida.liu.se;Institute of Informatics, Warsaw University, 02-097 Warsaw, Poland. E-mail: andsz@mimuw.eu.pl

  • Venue:
  • Fundamenta Informaticae
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a language for defining paraconsistent rough sets and reasoning about them. Our framework relates and brings together two major fields: rough sets [23] and paraconsistent logic programming [9]. To model inconsistent and incomplete information we use a four-valued logic. The language discussed in this paper is based on ideas of our previous work [21,32,22] developing a four-valued framework for rough sets. In this approach membership function, set containment and set operations are four-valued, where logical values are t (true), f (false), i (inconsistent) and u (unknown). We investigate properties of paraconsistent rough sets as well as develop a paraconsistent rule language, providing basic computational machinery for our approach.