充足可能性問題
The "Boolean satisfiability problem" (SAT) is, given a formula, to check whether it is satisfiable.