Using cutwidth to improve symbolic simulation and Boolean satisfiability.

Dong Wang Edmund M. Clarke Yunshan Zhu James H. Kukula

Published in: HLDVT (2001)

Keyphrases

boolean satisfiability
sat solvers
objective function
computational complexity
special case
symmetry breaking
probabilistic planning
random sat instances