@inproceedings{53152dac3ef44e85b0d12dcd45e4b629,

title = "Automatic triggering of constraint propagation",

abstract = "A constraint satisfaction problem requires a value, selected from a given finite domain, to be assigned to each variable in the problem, so that all constraints relating the variables are satisfied. The main feature of any constraint solver is constraint propagation, it embeds any reasoning which consists in explicitly forbidding values or combinations of values for some variables of a problem because a given subset of its constraints cannot be satisfied otherwise. It is very important to apply constraint propagation as efficiently as possible. In this paper, we present a hybrid solver based on a Branch and Bound algorithm combined with constraint propagation to reduce the search space. Some rules trigger constraint propagation based on some observations of the solving process. The results show that is possible to make reasonable use of constraint propagation.",

keywords = "Constraint propagation, Constraint satisfaction problems, Constraint solving",

author = "Eric Monfroy and Broderick Crawford and Ricardo Soto",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2013.; null ; Conference date: 24-06-2013 Through 27-06-2013",

year = "2013",

language = "English",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "452--461",

editor = "Beniamino Murgante and Apduhan, {Bernady O.} and Hong-Quang Nguyen and Maurizio Carlini and Maurizio Carlini and Osvaldo Gervasi and David Taniar and Sanjay Misra and Sanjay Misra and Torre, {Carmelo M.}",

booktitle = "Computational Science and Its Applications - ICCSA 2013, 13th International Conference, Proceedings",

}