An Architecture for Solving Boolean Satisfiability Using Runtime Configurable Hardware.
C. K. ChungPhilip Heng Wai LeongPublished in: ICPP Workshops (1999)
Keyphrases
- boolean optimization
- boolean satisfiability
- sat solving
- sat solvers
- probabilistic planning
- branch and bound algorithm
- random sat instances
- sat problem
- randomly generated
- integer linear programming
- symmetry breaking
- sat instances
- combinatorial optimization
- combinatorial problems
- maximum satisfiability
- boolean formula
- lower bound
- orders of magnitude
- max sat
- nonlinear programming
- branch and bound
- constraint programming
- upper bound