Guiding Search Using Constraint-Level Advice

Constraint satisfaction problems are traditionally solved using some form of backtrack search that propagates constraints after each decision is made. The efficiency of search relies heavily on the use of good variable and value ordering heuristics. In this paper we show that constraints can also be used to guide the search process by actively proposing the next choice point to be branched on. We show that search effort can be reduced significantly.

Authors

• Radoslaw Szymanek
• Barry O'Sullivan

Keywords

No keywords are indexed for this paper.