On the Rough Realations: An Alternative Formulation

Another formulation of the notion of rough relations is presented. Instead of using two equivalence relations on two universes, or a joint equivalence relation on their Cartesian product, we start from specific classes of binary relations obeying certain properties. The chosen class of relations is a subsystem of all binary relations and represents relations we are interested. An arbitrary relation is approximated by a pair of relations in the chosen class.

[1]  I. Düntsch.  Rough Sets and Algebras of Relations , 1998 .

[2]  Yiyu Yao,et al.  Generalization of Rough Sets using Modal Logics , 1996, Intell. Autom. Soft Comput..

[3]  Lech Polkowski,et al.  Rough Sets in Knowledge Discovery 2 , 1998 .

[4]  Andrzej Skowron,et al.  Approximation of Relations , 1993, RSKD.

[5]  Yiyu Yao,et al.  On Generalizing Pawlak Approximation Operators , 1998, Rough Sets and Current Trends in Computing.

[6]  C. J. V. Rijsbergen,et al.  Rough Sets, Fuzzy Sets and Knowledge Discovery , 1994, Workshops in Computing.

[7]  Zdzislaw Pawlak,et al.  Rough Sets, Rough Relations and Rough Functions , 1996, Fundam. Informaticae.

[8]  George Gratzer,et al.  Universal Algebra , 1979 .

[9]  Sadaaki Miyamoto,et al.  Rough Sets and Current Trends in Computing , 2012, Lecture Notes in Computer Science.

[10]  Yiyu Yao,et al.  A Comparative Study of Fuzzy Sets and Rough Sets , 1998 .

[11]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[12]  Yiyu Yao,et al.  Two views of the theory of rough sets in finite universes , 1996, Int. J. Approx. Reason..

[13]  Zdzisław Pawlak.  On rough relations , 1986 .

[14]  Salvatore Greco,et al.  A New Rough Set Approach to Multicriteria and Multiattribute Classification , 1998, Rough Sets and Current Trends in Computing.

[15]  Jaroslaw Stepaniuk,et al.  Approximation Spaces in Extensions of Rough Set Theory , 1998, Rough Sets and Current Trends in Computing.