On the structure of rough approximations
Fundamenta Informaticae
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
On Logic with Fuzzy and Rough Powerset Monads
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Partially Ordered Monads for Monadic Topologies, Rough Sets and Kleene Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Partially ordered monads and rough sets
Transactions on rough sets VIII
Categories of direlations and rough set approximation operators
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
| Hi-index | 0.00 |
Traditionally, rough sets build upon relations based on ordinary sets, i.e. relations on X as subsets of X×X. A starting point of this paper is the equivalent view on relations as mappings from X to the (ordinary) power set PX. Categorically, P is a set functor, and even more so, it can in fact be extended to a monad (P,η,μ). This is still not enough and we need to consider the partial order (PX,≤). Given this partial order, the ordinary power set monad can be extended to a partially ordered monad. The partially ordered ordinary power set monad turns out to contain sufficient structure in order to provide rough set operations. However, the motivation of this paper goes far beyond ordinary relations as we show how more general power sets, i.e. partially ordered monads built upon a wide range of set functors, can be used to provide what we call rough monads.