FPGA Acceleration of a Stochastic Local Search Portfolio Solver for Boolean Satisfiability.
Christopher ChuvalasRanga VemuriPublished in: MWSCAS (2022)
Keyphrases
- boolean satisfiability
- stochastic local search
- sat solving
- sat problem
- random sat instances
- max sat
- randomly generated
- sat instances
- satisfiability problem
- sat solvers
- boolean formula
- phase transition
- clause learning
- branch and bound algorithm
- np complete
- tree search
- constraint satisfaction problems
- branch and bound
- search algorithm
- davis putnam
- lower bound
- probabilistic planning
- constraint satisfaction
- propositional satisfiability
- orders of magnitude
- graph coloring
- symmetry breaking
- tabu search
- random sat
- upper bound
- combinatorial problems
- search tree
- heuristic search
- cellular automata
- constraint propagation
- integer linear programming
- decision problems