Monads Can Be Rough
From MaRDI portal
Publication:3535437
DOI10.1007/11908029_9zbMath1162.18301OpenAlexW1585633710MaRDI QIDQ3535437
M. Ángeles Galán, Patrik E. Eklund
Publication date: 13 November 2008
Published in: Rough Sets and Current Trends in Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11908029_9
Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15)
Related Items (9)
New Algebras and Logic from a Category of Rough Sets ⋮ Categories of rough sets and textures ⋮ Dicovering approximation spaces and definability ⋮ A category approach to relation preserving functions in rough set theory ⋮ Rough Objects in Monoidal Closed Categories ⋮ Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability ⋮ Partially Ordered Monads and Rough Sets ⋮ Categorical Innovations for Rough Sets ⋮ Partially Ordered Monads for Monadic Topologies, Rough Sets and Kleene Algebras
This page was built for publication: Monads Can Be Rough
