A relational model of data for large shared data banks
Communications of the ACM
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Preimage Relations and Their Matrices
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Approximation of sets based on partial covering
Theoretical Computer Science
On galois connections and soft computing
IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advences in computational intelligence - Volume Part II
Approximation of sets based on partial covering
Transactions on Rough Sets XVI
Duality in Rough Set Theory Based on the Square of Opposition
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Hi-index | 0.00 |
In this paper we show that each Galois connection between two complete lattices determines an Armstrong system, that is, a closed set of dependencies. Especially, we study Galois connections and Armstrong systems determined by Pawlak's information systems.