Guiding Search using Constraint-level Advice

Authors:
Radoslaw Szymanek;Barry O'Sullivan
Affiliations:
Cork Constraint Computation Centre, University College Cork, Ireland. {r.szymanek|b.osullivan}@4c.ucc.ie;Cork Constraint Computation Centre, University College Cork, Ireland. {r.szymanek|b.osullivan}@4c.ucc.ie
Venue:
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Year:
2006

Citing 10
Cited 2

Dual viewpoint heuristics for binary constraint satisfaction problems

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
A filtering algorithm for constraints of difference in CSPs

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
New methods to color the vertices of a graph

Communications of the ACM
Increasing Constraint Propagation by Redundant Modeling: \an Experience Report

Constraints
Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Constraints-driven scheduling and resource assignment

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Dual modelling of permutation and injection problems

Journal of Artificial Intelligence Research
Counting solutions of CSPs: a structural approach

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Value ordering for finding all solutions

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Constraint programming based column generation for employee timetabling

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Confidence-based work stealing in parallel constraint programming

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Counting-based search: branching heuristics for constraint satisfaction problems

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.