TY - GEN
T1 - Enumeration strategies in constraint programming for solving puzzles
AU - Crawford, Broderick
AU - Aranda, Mary
AU - Castro, Carlos
AU - Monfroy, Eric
PY - 2007
Y1 - 2007
N2 - Constraint Programming is one of the major contributions of Computer Science for solving problems of high complexity. This paradigm is used to represent a wide variety of problems that can be modeled like Constraint Satisfaction Problems and solving them via Constraint Propagation and Enumeration. In this work, we study the resolution of puzzles with this approach, we evaluate the performance of different variable and value selection heuristics in the Enumeration phase. It is demonstrated the relevance of the Enumeration Strategy in a Constraint Programming process.
AB - Constraint Programming is one of the major contributions of Computer Science for solving problems of high complexity. This paradigm is used to represent a wide variety of problems that can be modeled like Constraint Satisfaction Problems and solving them via Constraint Propagation and Enumeration. In this work, we study the resolution of puzzles with this approach, we evaluate the performance of different variable and value selection heuristics in the Enumeration phase. It is demonstrated the relevance of the Enumeration Strategy in a Constraint Programming process.
UR - http://www.scopus.com/inward/record.url?scp=47349130227&partnerID=8YFLogxK
U2 - 10.1109/CERMA.2007.4367772
DO - 10.1109/CERMA.2007.4367772
M3 - Conference contribution
AN - SCOPUS:47349130227
SN - 0769529747
SN - 9780769529745
T3 - Electronics, Robotics and Automotive Mechanics Conference, CERMA 2007 - Proceedings
SP - 718
EP - 723
BT - Electr., Rob. Autom. Mech. Conf., CERMA - Proc.
T2 - Electronics, Robotics and Automotive Mechanics Conference, CERMA 2007
Y2 - 25 September 2007 through 28 September 2007
ER -