Description: 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.
To Search:
File list (Check if you may need any files):
sat\sat.class
...\sat.java
...\Sat问题.doc
sat
Download