SAT问题也称为合取范式的可满足问题，一个合取范式形如：A1∧A2∧…∧An，子句Ai（1≤i≤n）形如：a1∨a2∨…∨ak，其中，ai称为文字，为某一布尔变量或该布尔变量的非。SAT问题是指：是否存在一组对所有布尔变量的赋值（TRUE或FALSE），使得整个合取范式取值为真。
SAT problem is also known as conjunctive normal form satisfiability problem, a conjunctive normal form: A1 ∧ A2 ∧ ... ∧ An, clause Ai (1 ≤ i ≤ n) of the form: a1 ∨ a2 ∨ ... ∨ ak, where , ai as text, for a Boolean variable or the non-Boolean variables. SAT question is: Is there a set of assignment of all Boolean variables (TRUE or FALSE), makes the whole CNF value is true. (2011-01-10, Java, 72KB, 下载35次)