Tolerance approximation spaces
Fundamenta Informaticae - Special issue: rough sets
A Generalized Definition of Rough Approximations Based on Similarity
IEEE Transactions on Knowledge and Data Engineering
About Tolerance and Similarity Relations in Information Systems
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
On the Structure of Rough Approximations
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Algebras of Approximating Regions
Fundamenta Informaticae - Qualitative Spatial Reasoning
The Axiomatization of the Rough Set Upper Approximation Operations
Fundamenta Informaticae
Modal-Like Operators in Boolean Lattices, Galois Connections and Fixed Points
Fundamenta Informaticae
A unifying study between modal-like operators, topologies and fuzzy sets
Fuzzy Sets and Systems
A short note on algebraic T-rough sets
Information Sciences: an International Journal
Logics from Galois connections
International Journal of Approximate Reasoning
Partially Ordered Monads for Monadic Topologies, Rough Sets and Kleene Algebras
Electronic Notes in Theoretical Computer Science (ENTCS)
Algebraic Properties of Generalized Rough Sets
Fundamenta Informaticae
Approximation Algebra and Framework
Fundamenta Informaticae - Fundamentals of Knowledge Technology
Algebraic aspects of generalized approximation spaces
International Journal of Approximate Reasoning
New Approach in Defining Rough Approximations
RSFDGrC '09 Proceedings of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
Invertible approximation operators of generalized rough sets and fuzzy rough sets
Information Sciences: an International Journal
Transactions on rough sets VI
A unifying abstract approach for rough models
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Partially ordered monads and rough sets
Transactions on rough sets VIII
Towards the theory of M-approximate systems: Fundamentals and examples
Fuzzy Sets and Systems
New approach in defining rough approximations
Transactions on rough sets XIV
On axiomatic characterization of approximation operators based on atomic boolean algebras
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
Rough sets over the boolean algebras
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Information Sciences: an International Journal
Roughness based on fuzzy ideals
Information Sciences: an International Journal
An application of rough sets to graph theory
Information Sciences: an International Journal
| Hi-index | 0.00 |
We study rough approximations based on indiscernibility relations which are not necessarily reflexive, symmetric or transitive. For this, we define in a lattice-theoretical setting two maps which mimic the rough approximation operators and note that this setting is suitable also for other operators based on binary relations. Properties of the ordered sets of the upper and the lower approximations of the elements of an atomic Boolean lattice are studied.