Accelerating Boolean Satisfiability with Configurable Hardware.
Peixin ZhongMargaret MartonosiPranav AsharSharad MalikPublished in: FCCM (1998)
Keyphrases
- boolean satisfiability
- sat solvers
- boolean optimization
- randomly generated
- symmetry breaking
- sat solving
- probabilistic planning
- branch and bound algorithm
- sat problem
- integer linear programming
- maximum satisfiability
- combinatorial problems
- phase transition
- max sat
- boolean formula
- satisfiability problem
- evolutionary algorithm
- sat instances
- planning problems
- combinatorial optimization
- constraint satisfaction
- cellular automata
- random sat instances
- special case