How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas.
Tassos DimitriouPaul G. SpirakisPublished in: WEA (2004)
Keyphrases
- boolean formula
- sat solvers
- practical problems
- np complete
- conjunctive normal form
- boolean satisfiability
- linear constraints
- sat problem
- membership queries
- binary decision diagrams
- max sat
- sat instances
- satisfiability problem
- evolutionary algorithm
- cnf formula
- equivalence queries
- boolean functions
- phase transition
- unsatisfiable cores