The Impact of Branching Heuristics in Propositional Satisfiability Algorithms

摘要: This paper studies the practical impact of branching heuristics used in Propositional Satisfiability (SAT) algorithms, when applied to solving real-world instances SAT. In addition, different SAT algorithms are experimentally evaluated. The main conclusion this study is that even though crucial for SAT, other aspects organization also essential. Moreover, we provide empirical evidence search pruning techniques included most competitive may be more fundamental significance than heuristics.