Propositional logics from rough set theory

  • Authors:

  • Mohua Banerjee;Md. Aquil Khan

  • Affiliations:

  • Department of Mathematics and Statistics, Indian Institute of Technology, Kanpur, India;Department of Mathematics and Statistics, Indian Institute of Technology, Kanpur, India

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

Quantified Score

Hi-index 0.01

Visualization

Abstract

The article focusses on propositional logics with semantics based on rough sets. Many approaches to rough sets (including generalizations) have come to the fore since the inception of the theory, and resulted in different "rough logics" as well. The essential idea behind these logics is, quite naturally, to interpret well-formed formulae as rough sets in (generalized) approximation spaces. The syntax, in most cases, consists of modal operators along with the standard Boolean connectives, in order to reflect the concepts of lower and upper approximations. Non-Boolean operators make appearances in some cases too. Information systems ("complete" and "incomplete") have always been the "practical" source for approximation spaces. Characterization theorems have established that a rough set semantics based on these "induced" spaces, is no different from the one mentioned above. We also outline some other logics related to rough sets, e.g. logics of information systems - which, in particular, feature expressions corresponding to attributes in their language. These systems address various issues, such as the temporal aspect of information, multiagent systems, rough relations. An attempt is made here to place this gamut of work, spread over the last 20 years, in one platform. We present the various relationships that emerge and indicate questions that surface.