Author(s)

Bing Li, Peng Tang, Tommy W. S. Chow

Department of Electronic Engineering, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong.

We demonstrate rough set based attribute reduction is a sub-problem of propositional satisfiability problem. Since satisfiability problem is classical and sophisticated, it is a smart idea to find solutions of attribute reduction by methods of satisfiability. By extension rule, a method of satisfiability, the distribution of solutions with different numbers of attributes is obtained without finding all attribute reduction. The relation between attribute reduction and missing is also analyzed from computational cost and amount of solutions.

attribute reduction; extension rule; distribution of solutions; quantization

B. Li, P. Tang and T. Chow, "Quantization of Rough Set Based Attribute Reduction," Journal of Software Engineering and Applications, Vol. 5 No. 12B, 2012, pp. 117-123. doi: 10.4236/jsea.2012.512B023.