Algorithms for solving the reducts problem in rough sets

This work deals with finding minimal reducts of decision table based on the rough sets theory. Its goal is to develop algorithms capable of finding such reducts. Two algorithms are presented in this report: the first based on Boolean reasoning function, the second based on Genetic Algorithm. Test results on real data are given and conclusions are made