A SAT algorithm can determine whether any given CNF formula is satisfiable in limited time. DPLL algorithm and resolution refutation are two key methods resolving SAT problems.

• 一个SAT算法能在有限时间内判定任意给定的CNF公式是否可满足，DPLL算法和消解反驳法是判定SAT问题的两个重要方法。