A Fast SAT Solver Strategy Based on Negated Clauses.
Romanelli Lodron ZuimJosé T. de SousaClaudionor José Nunes Coelho Jr.Published in: VLSI-SoC (2006)
Keyphrases
- sat solvers
- boolean satisfiability
- clause learning sat solvers
- clause learning
- search space
- boolean formula
- search strategies
- unsatisfiable cores
- sat solving
- max sat
- search strategy
- sat problem
- sat instances
- constraint satisfaction
- search tree
- random sat instances
- propositional satisfiability
- propositional theories
- max sat solver
- orders of magnitude
- symmetry breaking
- integer linear programming
- sat encodings
- hidden structure
- first order logic
- randomly generated
- heuristic search
- search algorithm