Dual viewpoint heuristics for binary constraint satisfaction problems
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
Artificial Intelligence
Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Sampling strategies and variable selection in weighted degree heuristics
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
| Hi-index | 0.00 |
Constraint Satisfaction Problems (CSPs) and Propositional Satisfiability (SAT) are two closely related frameworks used for solving hard combinatorial problems. Despite their similarities regarding the problem formulation and the basic backtracking search algorithms they use, several advanced techniques have been developed and standardized in one framework but have been rather ignored in the other. One class of such techniques includes branching heuristics for variable and value ordering. Typically, SAT heuristics are highly sophisticated while CSP ones tend to be simplistic. In this paper we study some well known SAT heuristics with the aim of transferring them to the CSP framework. Through this attempt, new CSP branching techniques are developed; exploiting information not used by most of the standard CSP heuristics. For instance such information can be the arity of the constraints and the supports of values on the constraints. Preliminary empirical results on random problems show that this unexploited information can be used to design new efficient CSP heuristics or to enhance the performance of existing ones, like dom/wdeg.