In order to overcome the shortcomings of computing attribute reduction based on discernibility matrix, the decision tables was simplified, and the definition of Boolean discernibility matrix and the method of logical operation based on Boolean discernibility matrix were provided. The corresponding definitions of core attributes and attribute reduction based on Boolean discernibility matrix were put forward. It was proved that core attributes and attribute reduction acquired from the definitions are equivalent to the core attributes and attribute reduction based on positive region. Then, the algorithm for computing attribute reduction based on logical operation of Boolean discernibility matrix was designed, and its time and space complexity were all O(|C||U/C|2).Finally, the example and experiments were used to explain the feasibility and effectiveness of the method.
