SAT as a CSP
Variable in CSP for each variable/letter in SAT
Each domain Di = {true, false}
Constraint corresponds to each clause
- disallows unique tuple which falsifies clause
- e.g. (not A) or (B) or (not C)
- ? not < A = true, B = false, C = true >
Not binary CSP unless all clauses 2-clauses