On relationship between modified sets, topological spaces and rough sets
Fuzzy Sets and Systems
Tolerance approximation spaces
Fundamenta Informaticae - Special issue: rough sets
Relational interpretations of neighborhood operators and rough set approximation operators
Information Sciences—Informatics and Computer Science: An International Journal
A relational model of data for large shared data banks
Communications of the ACM
Discrete Mathematics
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
Incomplete Information: Structure, Inference, Complexity
Incomplete Information: Structure, Inference, Complexity
Essential Discrete Mathematics
Essential Discrete Mathematics
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
Fundamenta Informaticae
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
On the structure of generalized rough sets
Information Sciences: an International Journal
Robust Elements in Rough Set Abstractions
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Lattice Derived by Double Indiscernibility and Computational Complementarity
RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
Order ideals of a quasi-ordered set and graywater
ACMOS'10 Proceedings of the 12th WSEAS international conference on Automatic control, modelling & simulation
A non-Boolean lattice derived by double indiscernibility
Transactions on rough sets XII
General tool-based approximation framework based on partial approximation of sets
RSFDGrC'11 Proceedings of the 13th international conference on Rough sets, fuzzy sets, data mining and granular computing
Approximation of sets based on partial covering
Theoretical Computer Science
Double Approximation and Complete Lattices
Fundamenta Informaticae - Knowledge Technology
Dialectics of counting and the mathematics of vagueness
Transactions on Rough Sets XV
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 |
This work focuses on lattice-theoretical foundations of rough set theory. It consist of the following sections: 1: Introduction 2: Basic Notions and Notation, 3: Orders and Lattices, 4: Distributive, Boolean, and Stone Lattices, 5: Closure Systems and Topologies, 6: Fixpoints and Closure Operators on Ordered Sets, 7: Galois Connections and Their Fixpoints, 8: Information Systems, 9: Rough Set Approximations, and 10: Lattices of Rough Sets. At the end of each section, brief bibliographic remarks are presented.