On the Definability of a Set and Rough Set-Based Rule Generation

This paper reports the definability of a set of objects and rough set-based rule generation. In a standard table, we at first obtain equivalence classes with respect to an attribute set, and we solve the definability of a set X of objects. As the side effect, we obtain conditions for specifying the set X. We have extended this algorithm to tables with non-deterministic information, and implemented it according to the constraint satisfaction problem. This algorithm will be important for rule generation in tables with uncertainties.