Logics of time and computation
Logics of time and computation
Modal logics for knowledge representation systems
Theoretical Computer Science
Rough Sets: Mathematical Foundations
Rough Sets: Mathematical Foundations
Rough Set Semantics for Non-classical Logics
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Modal-style operators in qualitative data analysis
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Constructive and algebraic methods of the theory of rough sets
Information Sciences: an International Journal
On the structure of generalized rough sets
Information Sciences: an International Journal
Axiomatic systems for rough sets and fuzzy rough sets
International Journal of Approximate Reasoning
The algebraic structures of generalized rough set theory
Information Sciences: an International Journal
Note on "Generalized rough sets based on reflexive and transitive relations"
Information Sciences: an International Journal
An Equivalent Definition of Rough Sets
RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
An Interpretation of Belief Functions on Infinite Universes in the Theory of Rough Sets
RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
A comparison of two types of rough sets induced by coverings
International Journal of Approximate Reasoning
On Fuzzy Rough Set Algebras in Infinite Universes
RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
Rough set theory based on two universal sets and its applications
Knowledge-Based Systems
Some mathematical structures of generalized rough sets in infinite universes of discourse
Transactions on rough sets XIII
Axiomatic systems for rough set-valued homomorphisms of associative rings
International Journal of Approximate Reasoning
Approximations in Rough Sets vs Granular Computing for Coverings
International Journal of Cognitive Informatics and Natural Intelligence
Minimal Description and Maximal Description in Covering-based Rough Sets
Fundamenta Informaticae
Hi-index | 0.00 |
In this paper, we introduce the notion of generalized algebraic lower (upper) approximation operator and give its characterization theorem. That is, for any atomic complete Boolean algebra ${\mathcal B}$ with the set ${\mathcal A}({\mathcal B})$ of atoms, a map $L: {\mathcal B} \rightarrow {\mathcal B}$ is an algebraic lower approximation operator if and only if there exists a binary relation R on ${\mathcal A}({\mathcal B})$ such that L = R−, where R− is the lower approximation defined by the binary relation R. This generalizes the results given by Yao.