TY - GEN
T1 - A reactive constraint programming formulation
AU - Monfroy, Eric
AU - Castro, Carlos
AU - Crawford, Broderick
PY - 2009
Y1 - 2009
N2 - Constraint Programming is a powerful paradigm for solving Combinatorial Problems. In this solver approach, Enumeration Strategies are crucial for resolution performances. In a previous work, we proposed a framework to reactively change strategies showing bad performances, and to use metabacktracks to restore better states when bad decisions were made. In this paper, we design and evaluate strategies to improve resolution performances of a set of problems. Experimental results show the effectiveness of our approach.
AB - Constraint Programming is a powerful paradigm for solving Combinatorial Problems. In this solver approach, Enumeration Strategies are crucial for resolution performances. In a previous work, we proposed a framework to reactively change strategies showing bad performances, and to use metabacktracks to restore better states when bad decisions were made. In this paper, we design and evaluate strategies to improve resolution performances of a set of problems. Experimental results show the effectiveness of our approach.
KW - Constraint programming
KW - Constraint satisfaction problems
KW - Enumeration strategies
KW - Reactive search
UR - http://www.scopus.com/inward/record.url?scp=77950993370&partnerID=8YFLogxK
U2 - 10.1109/MICAI.2009.33
DO - 10.1109/MICAI.2009.33
M3 - Conference contribution
AN - SCOPUS:77950993370
SN - 9780769539331
T3 - 8th Mexican International Conference on Artificial Intelligence - Proceedings of the Special Session, MICAI 2009
SP - 165
EP - 169
BT - 8th Mexican International Conference on Artificial Intelligence - Proceedings of the Special Session, MICAI 2009
T2 - 8th Mexican International Conference on Artificial Intelligence, MICAI 2009
Y2 - 9 November 2009 through 13 November 2009
ER -