Conflict-Based Selection of Branching Rules

摘要

We propose an adaptive framework for branching rule selection that is based on a set of branching rules. Each branching rule is attached a preference value that is dynamically adapted with respect to conflict analysis. Thus, our approach brings together two essential features of modern SAT algorithms which were traditionally independent from each other. Experimental results show the feasibility of our approach.