Efficient data structures for backtrack search SAT solvers.
Inês LynceJoão P. Marques SilvaPublished in: Ann. Math. Artif. Intell. (2005)
Keyphrases
- backtrack search
- efficient data structures
- sat solvers
- propositional satisfiability
- data structure
- orders of magnitude
- constraint satisfaction
- search space
- max sat
- search strategies
- sat problem
- search tree
- sat instances
- sat solving
- highly efficient
- constraint satisfaction problems
- symmetry breaking
- propositional logic