Skip to Main Content
Rough set theory has been successfully applied to many areas including machine learning pattern recognition decision analysis process control, knowledge discovery from databases. An algorithm in finding minimal reduction based on prepositional satisfiability (abbreviated as SAT) algorithm is proposed. A branch and bound algorithm is presented to solve the proposed SAT problem. The experimental result shows that the proposed algorithm has significantly reduced the number of rules generated form the obtained reduction with high percentage of classification accuracy.