Summary: Attacking Satisfiability with GAs
Peter G. Anderson,
Computer Science Department
Rochester Institute of Technology,
Rochester, New York
June 11, 2003
Satisfiability (SAT) is the mother of all NP-complete problems.
Herein we demonstrate two GA approaches to SAT: bit strings and
SAT: Is a given boolean function, f(x1, x2, · · · , xn) satisfiable?
Variables xi are TRUE or FALSE.
f combines the variables with AND, OR, NOT, and parentheses.
SAT asks whether the truth table for f has any T's.
If so, where?
This is an NP-complete problem (a standard one).