A four-valued logic for rough set-like approximate reasoning

  • Authors:

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

  • Affiliations:

  • Linköping University, Department of Computer and Information Science, Linköping, Sweden;Linköping University, Department of Computer and Information Science, Linköping, Sweden and The University of Economics and Computer Science, Olsztyn, Poland;Dept. of Science and Technology, Linköping University, Norrköping, Sweden

  • Venue:
  • Transactions on rough sets VI
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper extends the basic rough set formalism introduced by Pawlak [1] to a rule-based knowledge representation language, called Rough Datalog, where rough sets are represented by predicates and described by finite sets of rules. The rules allow us to express background knowledge involving rough concepts and to reason in such a knowledge base. The semantics of the new language is based on a four-valued logic, where in addition to the usual values TRUE and FALSE, we also have the values BOUNDARY, representing uncertainty, and UNKNOWN corresponding to the lack of information. The semantics of our language is based on a truth ordering different from the one used in the well-known Belnap logic [2, 3] and we show why Belnap logic does not properly reflect natural intuitions related to our approach. The declarative semantics and operational semantics of the language are described. Finally, the paper outlines a query language for reasoning about rough concepts.