Exploring limits of parallelism in FPGA-based Boolean satisfiability.
Teodor IvanEl Mostapha AboulhamidPublished in: MECO (2013)
Keyphrases
- boolean satisfiability
- sat solvers
- probabilistic planning
- boolean optimization
- branch and bound algorithm
- sat solving
- randomly generated
- integer linear programming
- sat problem
- symmetry breaking
- maximum satisfiability
- max sat
- combinatorial problems
- random sat instances
- phase transition
- constraint satisfaction
- boolean formula
- sat instances
- planning problems
- constraint satisfaction problems