Approximations and Rough Sets Based on Tolerances
RSCTC '00 Revised Papers from the Second International Conference on Rough Sets and Current Trends in Computing
On the structure of rough approximations
Fundamenta Informaticae
Construction of rough approximations in fuzzy setting
Fuzzy Sets and Systems
Information Sciences: an International Journal
Rough 3-Valued Łukasiewicz Agebras and MV-Algebras
RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
On generalizing rough set theory
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Rough sets and brouwer-zadeh lattices
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Two kinds of rough algebras and brouwer-zadeh lattices
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
Logic for rough sets with rough double stone algebraic semantics
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Subsystem based generalizations of rough set approximations
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
On the Structure of Rough Approximations
Fundamenta Informaticae
Generalized Rough Logics with Rough Algebraic Semantics
International Journal of Cognitive Informatics and Natural Intelligence
| 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.