New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability.
Renato BruniAndrea SantoriPublished in: Discret. Optim. (2008)
Keyphrases
- computational complexity
- significant improvement
- learning algorithm
- propositional satisfiability
- data structure
- evolutionary algorithm
- computational cost
- computationally efficient
- orders of magnitude
- heuristic search
- sat solving
- heuristic methods
- search tree
- search strategies
- np complete
- optimization problems
- worst case