Reducts in Information Systems1
Cecylia M. Rauszer · Fundamenta Informaticae · 1991
In the paper we consider properties of minimal sets of attributes (reducts) which determine an equivalence relation ind(P). We show that the problem to figure out all reducts of a given set is NP-complete. Subsequently, we present some properties of the set of all attributes which are indispensable to create ind(P).