Rough Sets and Algebras of Relations

  • Ivo Düntsch
Part of the Studies in Fuzziness and Soft Computing book series (STUDFUZZ, volume 13)


A survey of results is presented on relationships between the algebraic systems derived from the approximation spaces induced by information systems and various classes of algebras of relations. Rough relation algebras are presented and it is shown that they form a discriminator variety. A characterisation of the class of representable rough relation algebras is given. The family of closure operators derived from an approximation space is abstractly characterised as certain type of Boolean algebra with operators. A representation theorem is given which says that every such an algebra is isomorphic with a similar algebra that is derived from an information system.


Binary Relation Closure Operator Relation Algebra Approximation Space Discriminator Variety 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BG1]
    Balbes, R. & Grätzer, G.: Injective and projective Stone algebras. Duke Math. J., 38, (1971), 339–347MathSciNetMATHCrossRefGoogle Scholar
  2. [CT1]
    Chin, L. & Tarski, A.: Distributive and modular laws in the arithmetic of relation algebras. University of California Publications, 1, (1951), 341–384MathSciNetGoogle Scholar
  3. [Col]
    Corner, S.: An algebraic approach to the approximation of information. Fund. Inform., 14, (1991), 492–502MathSciNetGoogle Scholar
  4. [Co2]
    Corner, S.: On connections between information systems, rough sets, and algebraic logic. In: Algebraic Methods in Logic and Computer Science, Banach Center Publications, 28, (1993), 117–124Google Scholar
  5. [Co3]
    Corner, S.: Perfect extensions of regular double Stone algebras. Algebra Universalis, 34, (1995), 96–109MathSciNetCrossRefGoogle Scholar
  6. [Dul]
    Düntsch, I.: Rough relation algebras. Fund. Inform., 21, (1994), 321–331MathSciNetMATHGoogle Scholar
  7. [HMT1]
    Henkin, L., Monk, J.D. & Tarski, A.: Cylindric Algebras. Part I, North Holland, Amsterdam, (1971)MATHGoogle Scholar
  8. [HMT2]
    Henkin, L., Monk, J.D. & Tarski, A.: Cylindric Algebras. Part II, North Holland, Amsterdam, (1985)Google Scholar
  9. [Iwl]
    Iwinski, T.B.: Algebraic approach to rough sets. Bull. Polish Acad. Sci. Math., 35, (1987), 673–683MathSciNetMATHGoogle Scholar
  10. [Jol]
    Jónsson, B.: Varieties of relation algebras. Algebra Universalis, 15, (1982), 273–298MathSciNetMATHCrossRefGoogle Scholar
  11. [Jo2]
    Jónsson, B.: The theory of binary relations. In: Algebraic Logic, edited by Andréka, H., Monk, J.D. & Németi, I.: volume 54 of Colloquia Mathematica Societatis Jänos Bolyai, North Holland, Amsterdam, (1991), 245–292Google Scholar
  12. [JAN1]
    Jónsson, B., Andréka, H. & Németi, I.: Free algebras in discriminator varieties. Algebra Univ, 28, (1991), 401–447MATHCrossRefGoogle Scholar
  13. [Kal]
    Katrinâ,k, T.: Construction of regular double p—algebras. Bull. Soc. Roy. Sci. Liège, 43, (1974), 294–301Google Scholar
  14. [Mol]
    Monk, J.D.: Mathematical Logic. Springer, (1976)Google Scholar
  15. [Pal]
    Pawlak, Z.: Information systems, theoretical foundations. Information Systems, 6, (1981), 205–218MATHCrossRefGoogle Scholar
  16. [Pa2]
    Pawlak, Z.: Rough sets. Internat. J. Comput. Inform. Sci., 11, (1982), 341–356MathSciNetMATHCrossRefGoogle Scholar
  17. [PP1]
    Pomykala, J. & Pomykala, J.A.: The Stone algebra of rough sets. Bull. Polish Acad. Sci. Math., 36, (1988), 495–508MathSciNetMATHGoogle Scholar
  18. [TG1]
    Tarski, A. Si Givant, S.: A Formalization of Set Theory without Variables. Volume 41 of Colloquium Publications, Amer. Math. Soc., Providence, (1987)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Ivo Düntsch
    • 1
  1. 1.School of Information and Software EngineeringUniversity of Ulster at JordanstownNewtownabbeyN.Ireland

Personalised recommendations