Conflict directed variable selection strategies for constraint satisfaction problems

Authors:
Thanasis Balafoutis;Kostas Stergiou
Affiliations:
Department of Information and Communication Systems Engineering, University of the Aegean, Samos, Greece;Department of Information and Communication Systems Engineering, University of the Aegean, Samos, Greece
Venue:
SETN'10 Proceedings of the 6th Hellenic conference on Artificial Intelligence: theories, models and applications
Year:
2010

Citing 5
Cited 1

Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Contradicting Conventional Wisdom in Constraint Satisfaction

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
BerkMin: A Fast and Robust Sat-Solver

Proceedings of the conference on Design, automation and test in Europe
Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming

Constraints
Sampling strategies and variable selection in weighted degree heuristics

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming

Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs

Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is well known that the order in which variables are instantiated by a backtracking search algorithm can make an enormous difference to the search effort in solving CSPs Among the plethora of heuristics that have been proposed in the literature to efficiently order variables during search, a significant recently proposed class uses the learning-from-failure approach Prime examples of such heuristics are the wdeg and dom/wdeg heuristics of Boussemart et al which store and exploit information about failures in the form of constraint weights The efficiency of all the proposed conflict-directed heuristics is due to their ability to learn though conflicts encountered during search As a result, they can guide search towards hard parts of the problem and identify contentious constraints Such heuristics are now considered as the most efficient general purpose variable ordering heuristic for CSPs In this paper we show how information about constraint weights can be used in order to create several new variants of the wdeg and dom/wdeg heuristics The proposed conflict-driven variable ordering heuristics have been tested over a wide range of benchmarks Experimental results show that they are quite competitive compared to existing ones and in some cases they can increase efficiency.