Variable and clause elimination in SAT problems using an FPGA.
Masayuki SuzukiTsutomu MaruyamaPublished in: FPT (2011)
Keyphrases
- sat problem
- truth assignment
- boolean formula
- cnf formula
- sat solvers
- satisfiability problem
- clause learning
- np complete
- phase transition
- constraint satisfaction problems
- sat instances
- elimination algorithm
- unit propagation
- randomly chosen
- boolean satisfiability
- max sat
- decision problems
- randomly generated
- sat solving
- propositional satisfiability
- hardware implementation
- stochastic local search
- search space
- backtracking search
- field programmable gate array
- davis putnam
- branch and bound
- propositional formulas
- orders of magnitude
- constraint satisfaction