Using SAT Encodings to Derive CSP Value Ordering Heuristics
Christophe Lecoutre, Lakhdar Saïs, Julien Vion · Journal on Satisfiability Boolean Modeling and Computation · 2007
In this paper, we address the issue of designing from SAT new value ordering heuristics for CSP. We show that using the direct and support SAT encodings of CSP instances, such heuristics can be naturally derived from the well-known two-sided Jeroslow