Tolerance approximation spaces
Fundamenta Informaticae - Special issue: rough sets
Incomplete Information: Rough Set Analysis
Incomplete Information: Rough Set Analysis
A Generalized Definition of Rough Approximations Based on Similarity
IEEE Transactions on Knowledge and Data Engineering
On Generalizing Pawlak Approximation Operators
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Approximations and Rough Sets Based on Tolerances
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
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
Approximation Algebra and Framework
Fundamenta Informaticae - Fundamentals of Knowledge Technology
Algebraic Properties of Generalized Rough Sets
Fundamenta Informaticae
Modal-Like Operators in Boolean Lattices, Galois Connections and Fixed Points
Fundamenta Informaticae
The Axiomatization of the Rough Set Upper Approximation Operations
Fundamenta Informaticae
Information Sciences: an International Journal
Rough sets based on complete completely distributive lattice
Information Sciences: an International Journal
Rough sets based on complete completely distributive lattice
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.