In this paper we will show that partially ordered monads contain appropriate structure for modeling rough sets in a generalized relational setting. Partially ordered monads are further shown to be useful in topological and generalized convergence frameworks. The paper thus demonstrates the use of monad constructions for applications to rough sets and even further towards entirely new types of applications of these generalized rough sets. In doings so, the paper opens up previously unknown research directions for rough sets both towards applications within other theoretical research areas but also for real world applications. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Eklund, P., & Galán, M. Á. (2008). Partially ordered monads and rough sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5084 LNCS, pp. 53–74). https://doi.org/10.1007/978-3-540-85064-9_4
Mendeley helps you to discover research relevant for your work.