Extensions and intentions in the rough set theory
Information Sciences: an International Journal
Rules in incomplete information systems
Information Sciences: an International Journal
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
A comparative study of some generalized rough approximations
Fundamenta Informaticae
A Generalized Definition of Rough Approximations Based on Similarity
IEEE Transactions on Knowledge and Data Engineering
Reduction and axiomization of covering generalized rough sets
Information Sciences: an International Journal
Constructive and axiomatic approaches of fuzzy approximation operators
Information Sciences—Informatics and Computer Science: An International Journal - Mining stream data
Information-preserving hybrid data reduction based on fuzzy-rough techniques
Pattern Recognition Letters
Topological approaches to covering rough sets
Information Sciences: an International Journal
Information Sciences: an International Journal
Expert Systems with Applications: An International Journal
Rough set theory for the interval-valued fuzzy information systems
Information Sciences: an International Journal
Fuzzy rough set theory for the interval-valued fuzzy information systems
Information Sciences: an International Journal
Relationship between generalized rough sets based on binary relation and covering
Information Sciences: an International Journal
Approaches to knowledge reduction of covering decision systems based on information theory
Information Sciences: an International Journal
On axiomatic characterizations of three pairs of covering based approximation operators
Information Sciences: an International Journal
Constructive and algebraic methods of the theory of rough sets
Information Sciences: an International Journal
Textural approach to generalized rough sets based on relations
Information Sciences: an International Journal
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Local and global approximations for incomplete data
Transactions on rough sets VIII
Information Sciences: an International Journal
A new algebraic structure for formal concept analysis
Information Sciences: an International Journal
Rough set approximations in formal concept analysis
Transactions on Rough Sets V
Information Sciences: an International Journal
Hi-index | 0.07 |
In this paper, the concept of intension is used to introduce two types of ordering relations based on information that generates a cover for the universal set. These types of ordering relations are distinct from the well-known ordering relation based on set inclusion. For these ordering relations, we consider the algebraic structures that arise in various types of covers. We show that in the case of a representative cover, the algebraic structure resulting from the lower intension inclusion is a double Stone algebra, while in the case of a reduced cover, it is a Boolean algebra. In addition, the algebraic structure resulting from the upper intension inclusion in the case of a representative cover is a Boolean algebra, and in the case of a reduced cover, the two Boolean algebraic structures from lower and upper intension inclusions are isomorphic.