Accelerating boolean satisfiability through application specific processing.

Ying Zhao Sharad Malik Matthew W. Moskewicz Conor F. Madigan

Published in: ISSS (2001)

Keyphrases

application specific
boolean satisfiability
computation intensive
general purpose
sat solvers
boolean optimization
probabilistic planning
integer linear programming
symmetry breaking
branch and bound algorithm
upper bound
file system
phase transition
randomly generated
sat problem
max sat