Equivalence between two kinds of reducts and approaches to computing reducts in ordered information systems

Many kinds of reducts are proposed in incomplete or inconsistent ordered information systems in recent years. But some of these reducts are equivalent. In this paper, we prove that the reduct preserving compatible (possible) distribution functions is equivalent to the reducts preserving lower (upper) approximations and give a more simple method to compute the reducts.