Monads can be rough
2006 (English)In: : 5th International Conference, RSCTC 2006 Kobe, Japan, November 6-8, 2006 Proceedings, 2006, 77-84 p.Conference paper (Refereed)
Traditionally, rough sets build upon relations based on ordinary sets, i.e. relations on X as subsets of X 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,eta,mu). 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.
Place, publisher, year, edition, pages
2006. 77-84 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 4259/2006
IdentifiersURN: urn:nbn:se:umu:diva-23236DOI: 10.1007/11908029_9ISBN: 978-3-540-47693-1OAI: oai:DiVA.org:umu-23236DiVA: diva2:222282