Boost SAT solver with hybrid branching heuristic

Abstract

Most state-of-the-art SAT solvers use VSIDS as their branching heuristic because of its robustness. However, in general, a branching heuristic can not cover all problems. It is axiomatic that mixture of branching heuristic with adequate configuration performs better than single branching heuristic. In this paper, we propose hybrid branching heuristic and show some preliminary experimental results using benchmarks from SAT competitions to evaluate its efficiency.