A reactive constraint programming formulation

Eric Monfroy, Carlos Castro, Broderick Crawford

Research output: Contribution to conferencePaper

Abstract

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. © 2009 IEEE.
Original languageEnglish
Pages165-169
Number of pages5
DOIs
Publication statusPublished - 1 Dec 2009
Event8th Mexican International Conference on Artificial Intelligence - Proceedings of the Special Session, MICAI 2009 -
Duration: 1 Dec 2009 → …

Conference

Conference8th Mexican International Conference on Artificial Intelligence - Proceedings of the Special Session, MICAI 2009
Period1/12/09 → …

Cite this

Monfroy, E., Castro, C., & Crawford, B. (2009). A reactive constraint programming formulation. 165-169. Paper presented at 8th Mexican International Conference on Artificial Intelligence - Proceedings of the Special Session, MICAI 2009, . https://doi.org/10.1109/MICAI.2009.33