Algorithm for decision rules reduction based on binary discernibility matrix

The decision rules reduction,namely deleting the redundant attribute values of each rule in decision table,is an important topic in the research on data reduction based on rough set theory.It can be achieved by heuristic information after attribute reduction.A method for calculating decision rules core based on binary discernibility matrix is presented directly.And then,an algorithm for decision rules reduction is designed,which is suitable for not only consistent decision table but also inconsistent decision table.