Definability and other properties of approximations for generalized indiscernibility relations

  • Authors:
  • Jerzy W. Grzymala-Busse;Wojciech Rza̧sa

  • Affiliations:
  • Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS;Department of Computer Science, University of Rzeszow, Rzeszow, Poland

  • Venue:
  • Transactions on Rough Sets XI
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we consider a generalization of the indiscernibility relation, i.e., a relation R that is not necessarily reflexive, symmetric, or transitive. On the basis of granules, defined by R, we introduce the idea of definability. We study 28 basic definitions of approximations, two approximations are introduced for the first time. Furthermore, we introduce additional 8 new approximations. Our main objective is to study definability and coalescence of approximations. We study definability of all 28 basic approximations for reflexive, symmetric, and transitive relations. In particular, for reflexive relations, the set of 28 approximations is reduced, in general, to the set of 16 approximations.