A categorical unification algorithm
Proceedings of a tutorial and workshop on Category theory and computer programming
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Two Complete Axiom Systems for the Algebra of Regular Events
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
On the structure of rough approximations
Fundamenta Informaticae
ISMVL '01 Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic
Image Analysis and Mathematical Morphology
Image Analysis and Mathematical Morphology
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
Towards the theory of M-approximate systems: Fundamentals and examples
Fuzzy Sets and Systems
| Hi-index | 0.00 |
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.