Some algorithms related to consistent decision table

Rough set theory is useful mathematical tool developed to deal with vagueness and uncertainty. As an important concept of rough set theory, an attribute reduct is a subset of attributes that are jointly sufficient and individually necessary for preserving a particular property of the given information table. Rough set theory is also the most popular for generating decision rules from decision table. In this paper, we propose an algorithm finding object reduct of consistent decsion table. On the other hand, we also show an algorithm to find some attribute reducts and the correctness of our algorithms is proof-theoretically. These our algorithms have polynomial time complexity. Our finding object reduct helps other algorithms of finding attribute reducts become more effectively, especially as working with huge consistent decision table.