An algorithm in finding minimal reduction based on Propositional Satisfiability(abbreviated as SAT) algorithm is proposed.A branch and bound algorithm is presented to solve the proposed SAT problem.

• 本文提出了一种求最小约简的基于命题可满足性(简称SAT)的算法,提出一个解决SAT问题的分割和结合的算法。