The aim of this paper is to introduce and study set- valued homomorphism on lattices and T-rough lattice with respect to a sublattice. This paper deals with T-rough set approach on the lattice theory. The result of this study contributes to, T-rough fuzzy set and approximation theory and proved in several papers. Keywords: approximation space; lattice; prime ideal; rough ideal; T-rough set; set...

To tackle the problem with inexact, uncertainty and vague knowl- edge, constructive method is utilized to formulate lower and upper approx- imation sets. Rough set model over dual-universes in fuzzy approximation space is constructed. In this paper, we introduce the concept of rough set over dual-universes in fuzzy approximation space by means of cut set. Then, we discuss properties of rough se...

The main objective of this special issue is to present readers with the significantly extended and improved versions of the articles presented at the International Conference on Rough Sets, Fuzzy Sets, and Granular Computing (RSFDGrC’05) held in Regina, Canada in September 2005. In the standard rough set model, the lower and upper approximations are defined based on the two extreme cases (full ...

In this paper, we take a GL-quantale as the truth value table to study a new rough set model—L-valued fuzzy rough sets. The three key components of this model are: an L-fuzzy set A as the universal set, an L-valued relation of A and an L-fuzzy set of A (a fuzzy subset of fuzzy sets). Then L-valued fuzzy rough sets are completely characterized via both constructive and axiomatic approaches. 

Based on Pawlak’s two way approximations on Rough Sets and using thresholds G.Ganesan et al in 2004 proposed a method of rough indexing an information system which has fuzzy decision attributes. The limitation of Pawlak’s approximation is that it does not quantify the level of importance of the basic granules. Recently, Y.Y.Yao discussed Probabilistic Rough Set Model, which specified how basic ...

In this paper, the study of the evolution of approximation space theory and its applications is considered in the context of rough sets introduced by Zdzis law Pawlak and information granulation as well as computing with words formulated by Lotfi Zadeh. Central to this evolution is the rough-mereological approach to approximation of information granules. This approach is built on the inclusion ...

In this paper multi granulation rough sets is extended to variable precision to develop a model for multi-granulation variable precision rough sets. We define a lower approximation of the model and address the significance of granularity as heuristic information. We extend the ideas and design a granular space reduction algorithm of multi-granulation variable precision rough sets. Finally, an e...