You are here

Brock TR # CS-05-11 Abstract

Rough relation algebras revisited    [PDF]
Ivo Düntsch and Michael Winter, October 2005.

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 composition, converse, and the identity relation. In the present paper, which is a continuation of an earlier paper, we investigate the structure of abstract rough relation algebras further.