A Constraint-Based Approach to Narrow Search Trees for Satisfiability.
Chu Min LiPublished in: Inf. Process. Lett. (1999)
Keyphrases
- search tree
- symmetry breaking
- search algorithm
- satisfiability problem
- sat solving
- sat solvers
- search space
- branch and bound algorithm
- sat problem
- branching factor
- computational complexity
- np complete
- b tree
- sat instances
- sat encodings
- tree search
- np hard
- root node
- binary search trees
- boolean satisfiability
- database
- phase transition
- branch and bound
- special case
- state space
- boolean formula
- constraint satisfaction