Modal logics for knowledge representation systems
Logic at Botik'89 Symposium on logical foundations of computer science
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Mathematical Foundations
Rough Sets: Mathematical Foundations
Modal-style operators in qualitative data analysis
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Knowledge Representation Techniques (Studies in Fuzziness and Soft Computing)
Knowledge Representation Techniques (Studies in Fuzziness and Soft Computing)
Pawlak's Information Systems in Terms of Galois Connections and Functional Dependencies
Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Modal-Like Operators in Boolean Lattices, Galois Connections and Fixed Points
Fundamenta Informaticae
Transactions on rough sets VI
Double Approximation and Complete Lattices
Fundamenta Informaticae - Knowledge Technology
International Journal of Artificial Life Research
| Hi-index | 0.00 |
The central notion of a rough set is the indiscernibility that is based on an equivalence relation. Because an equivalence relation shows strong bondage in an equivalence class, it forms a Galois connection and the difference between the upper and lower approximations is lost. Here, we introduce two different equivalence relations, one for the upper approximation and one for the lower approximation, and construct a composite approximation operator consisting of different equivalence relations. We show that a collection of fixed points with respect to the operator is a lattice and there exists a representation theorem for that construction.