Rough Relation Algebras Revisited

Authors:
Ivo Düntsch;Michael Winter
Affiliations:
Department of Computer Science, Brock University, St. Catharines, Ontario, Canada, L2S 3A1. E-mail: {duentsch,mwinter}@brocku.ca;Department of Computer Science, Brock University, St. Catharines, Ontario, Canada, L2S 3A1. E-mail: {duentsch,mwinter}@brocku.ca
Venue:
Fundamenta Informaticae
Year:
2006

Citing 2
Cited 1

Incomplete Information: Rough Set Analysis

Incomplete Information: Rough Set Analysis
Approximation quality for sorting rules

Computational Statistics & Data Analysis

Discrete Duality for Rough Relation Algebras

Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday

Quantified Score

Hi-index	0.00

Visualization

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.