Abstract
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.
Get full access to this article
View all access options for this article.