Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases.
Christoph ZenglerWolfgang KüchlinPublished in: CASC (2010)
Keyphrases
- sat solvers
- clause learning
- numerically stable
- boolean formula
- orders of magnitude
- sat solving
- polynomial equations
- propositional satisfiability
- search tree
- sat problem
- search strategies
- constraint satisfaction
- boolean satisfiability
- search space
- sat instances
- davis putnam
- boolean functions
- max sat
- conjunctive normal form
- satisfiability problem
- data structure
- phase transition
- constraint satisfaction problems
- upper bound
- lower bound