Boolean satisfiability from theoretical hardness to practical success.

Sharad Malik Lintao Zhang

Published in: Commun. ACM (2009)

Keyphrases

boolean satisfiability
phase transition
sat solvers
sat problem
branch and bound algorithm
probabilistic planning
sat solving
boolean optimization
np hard
symmetry breaking
integer linear programming
learning theory
randomly generated
np complete
combinatorial problems
maximum satisfiability