Rough set theory has been a fruitful area in the field of knowledge discovery. Data mining algorithms are known to degrade in performance when faced with unnecessary attributes for rule extraction. In the last decades, numerous researches have been made for hybridization of fuzzy and rough sets. In this paper, it is purposed to construct an algorithm which can find reducts in a fuzzy database using fuzzy rough set approach based on discernibility matrix. In our approach, we deal with more general type of fuzzy sets. © Izmir University of Economics, Turkey, 2010.