Computation and automata
Proceedings of the International Spring School on Mathematical method of specification and synthesis of software systems '85
IEEE Transactions on Software Engineering - Special issue on computer security and privacy
Information security handbook
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Inductive Logic Programming: Techniques and Applications
Inductive Logic Programming: Techniques and Applications
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
On Generalizing Pawlak Approximation Operators
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Algebraic Aspects of the Relational Knowledge Representation: Modal Relation Algebras
Proceedings of the International Workshop on Nonclassical Logics and Information Processing
Reduction and axiomization of covering generalized rough sets
Information Sciences: an International Journal
On Three Types of Covering-Based Rough Sets
IEEE Transactions on Knowledge and Data Engineering
Security Engineering: A Guide to Building Dependable Distributed Systems
Security Engineering: A Guide to Building Dependable Distributed Systems
A Modal Logic for Pawlak's Approximation Spaces with Rough Cardinality n
Fundamenta Informaticae
An introduction to bipolar representations of information and preference
International Journal of Intelligent Systems
The many facets of natural computing
Communications of the ACM
Granular Computing and Rough Set Theory
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Relationship between generalized rough sets based on binary relation and covering
Information Sciences: an International Journal
Approximation Theories: Granular Computing vs Rough Sets
RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
A Geometry of Approximation: Rough Set Theory Logic, Algebra and Topology of Conceptual Patterns (Trends in Logic)
Approximation Algebra and Framework
Fundamenta Informaticae - Fundamentals of Knowledge Technology
Reduction about approximation spaces of covering generalized rough sets
International Journal of Approximate Reasoning
Transactions on rough sets VI
On generalizing rough set theory
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Rough set approximations in formal concept analysis and knowledge spaces
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
A unifying abstract approach for rough models
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Update and Illustration on Granular Computing: Practices, Theory and Future Directions
GRC '10 Proceedings of the 2010 IEEE International Conference on Granular Computing
Covering rough sets based on neighborhoods: An approach without using neighborhoods
International Journal of Approximate Reasoning
Simultaneous Anomaly and Misuse Intrusion Detections Based on Partial Approximative Set Theory
PDP '11 Proceedings of the 2011 19th International Euromicro Conference on Parallel, Distributed and Network-Based Processing
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
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
Approximation spaces and information granulation
Transactions on Rough Sets III
Rough set approximations in formal concept analysis
Transactions on Rough Sets V
Covering based rough set approximations
Information Sciences: an International Journal
Orthopairs: A Simple and Widely UsedWay to Model Uncertainty
Fundamenta Informaticae - Advances in Rough Set Theory
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
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
Three Approaches to Data Analysis: Test Theory, Rough Sets and Logical Analysis of Data
Three Approaches to Data Analysis: Test Theory, Rough Sets and Logical Analysis of Data
Tolerance Approximation Spaces
Fundamenta Informaticae
Comparison Of Rough-Set And Interval-Set Models For Uncertain Reasoning
Fundamenta Informaticae
Rough Sets and Intelligent Systems - Professor Zdzislaw Pawlak in Memoriam: Volume 2
Rough Sets and Intelligent Systems - Professor Zdzislaw Pawlak in Memoriam: Volume 2
Rough Sets and Intelligent Systems - Professor Zdzislaw Pawlak in Memoriam: Volume 1
Rough Sets and Intelligent Systems - Professor Zdzislaw Pawlak in Memoriam: Volume 1
Hi-index | 0.00 |
In classic Pawlakian rough set theory the sets used to approximations are equivalence classes which are pairwise disjoint and cover the universe. In this article we give up not only the pairwise disjoint property but also the covering of the universe. After a historical and philosophical background, we define a general set theoretic approximation framework. First, we reconstruct the rough set theory and partly restate its some well---known facts in the language of this framework. Next, we present a special approximation scheme. It is based on the partial covering of the universe which is called the base system and denoted by $\mathfrak{B}$. $\mathfrak{B}$-definable sets and lower and upper $\mathfrak{B}$-approximations are straightforward point---free generalizations of Pawlakian ones. We study such notions as single---layered base systems, $\mathfrak{B}$-representations of $\mathfrak{B}$-definable sets, and the exactness of sets. It is a well---known fact that the Pawlakian upper and lower approximations form a Galois connection. We clarify which conditions have to be satisfied by the upper and lower $\mathfrak{B}$-approximations so that they form a (regular) Galois connection. Excluding the cases when the empty set is the upper $\mathfrak{B}$-approximation of certain nonempty sets gives rise to a partial upper $\mathfrak{B}$-approximation map. We also clear up that a partial upper $\mathfrak{B}$-approximation map and a total lower $\mathfrak{B}$-approximation map form a partial Galois connection. In order to demonstrate the effectiveness of our approach we present three real---life examples in the last section.