Incomplete Information: Rough Set Analysis
Incomplete Information: Rough Set Analysis
Approximation quality for sorting rules
Computational Statistics & Data Analysis
Rough implication operator based on strong topological rough algebras
Information Sciences: an International Journal
An equivalent form of rough logic system RSL
RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
Discrete Dualities for Double Stone Algebras
Studia Logica
Lattice-Based relation algebras II
TARSKI'02-05 Proceedings of the 2006 international conference on Theory and Applications of Relational Structures as Knowledge Instruments - Volume 2
Hi-index | 0.00 |
Rough relation algebras arise from Pawlak's information systems by considering as object ordered pairs on a fixed set X. Thus, the subsets to be approximated are binary relations over X, and hence, we have at our disposal not only the set theoretic operations, but also the relational operators; ˘, and the identity relation 1'. In the present paper, which is a continuation of [6], we further investigate the structure of abstract rough relation algebras.