The Study of New Indiscernible Relation Based on Flexible Logic in Complete Information System

Rough set theory is used to deal with the imprecise data which attribute´s value is discrete. Flexible logic can satisfy the uncertain, incomplete and continuous data processing effectively in artificial intelligence. To re-define the indiscernible relation in rough set using universal equivalence relation, which can deal with both the discrete and continuous attributes directly, the new indiscernible relation can classify all the attributes with unified approach into equivalence classes based on universal (flexible) logic. This can abbreviate the discretization step in traditional processing and simplify the classification. This paper proves that the new definition is reasonable and illustrates it by instance.