umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Monads can be rough
Umeå University, Faculty of Science and Technology, Department of Computing Science.
Umeå University, Faculty of Science and Technology, Department of Computing Science.
2006 (English)In: : 5th International Conference, RSCTC 2006 Kobe, Japan, November 6-8, 2006 Proceedings, 2006, 77-84 p.Conference paper, Published paper (Refereed)
Abstract [en]

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.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 4259/2006
Identifiers
URN: urn:nbn:se:umu:diva-23236DOI: 10.1007/11908029_9ISBN: 978-3-540-47693-1 (print)OAI: oai:DiVA.org:umu-23236DiVA: diva2:222282
Available from: 2009-06-08 Created: 2009-06-08 Last updated: 2009-06-09

Open Access in DiVA

No full text

Other links

Publisher's full textLink to full proceedings

Search in DiVA

By author/editor
Eklund, Patrik
By organisation
Department of Computing Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 47 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf