Fuzzy sets as texture spaces: I. Representation theorems
Fuzzy Sets and Systems
Fault diagnosis using Rough Sets Theory
Computers in Industry
Using Rough Sets Theory to Predict German Word Stress
KI '94 Proceedings of the 18th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Fuzzy Sets and Systems
Generalized rough sets based on reflexive and transitive relations
Information Sciences: an International Journal
Constructive and algebraic methods of the theory of rough sets
Information Sciences: an International Journal
On the structure of generalized rough sets
Information Sciences: an International Journal
On generalizing rough set theory
RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Categories of direlations and rough set approximation operators
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
L-topological spaces as spaces of points
Fuzzy Sets and Systems
On lower and upper intension order relations by different cover concepts
Information Sciences: an International Journal
Textures and covering based rough sets
Information Sciences: an International Journal
A rough set approach for estimating correlation measures in quality function deployment
Information Sciences: an International Journal
International Journal of Approximate Reasoning
Rough set theory applied to lattice theory
Information Sciences: an International Journal
Attribute reduction of data with error ranges and test costs
Information Sciences: an International Journal
Fundamenta Informaticae - Advances in Rough Set Theory
The necessary and sufficient conditions for a fuzzy relation being Τ-Euclidean
Information Sciences: an International Journal
| Hi-index | 0.07 |
This paper presents a discussion on rough set theory from the textural point of view. A texturing is a family of subsets of a given universal set U satisfying certain conditions which are generally basic properties of the power set. The suitable morphisms between texture spaces are given by direlations defined as pairs (r,R) where r is a relation and R is a corelation. It is observed that the presections are natural generalizations for rough sets; more precisely, if (r,R) is a complemented direlation, then the inverse of the relation r (the corelation R) is actually a lower approximation operator (an upper approximation operator).