59 search results - page 4 / 12 » cp 2009 |
CP
2009
Springer
14 years 8 months ago
2009
Springer
In constraint satisfaction, basic inferences rely on some properties of constraint networks, called consistencies, that allow the identification of inconsistent instantiations (als...
CP
2009
Springer
14 years 8 months ago
2009
Springer
We prove that hull consistency for a system of equations or inequalities can be achieved in polynomial time providing that the underlying functions are monotone with respect to eac...
CP
2009
Springer
14 years 8 months ago
2009
Springer
This paper presents the first experimental evaluation of the length-lex domain for set variables. The implementation is based on bound-consistency algorithms proposed in earlier wo...
CP
2009
Springer
14 years 8 months ago
2009
Springer
Many problems require minimally perturbing an initial state in order to repair some violated constraints. We consider two search spaces for exactly solving this minimal perturbatio...
CP
2009
Springer
13 years 5 months ago
2009
Springer
Any sufficiently complex finite-domain constraint modelling language has the ability to express undefined values, for example division by zero, or array index out of bounds. This p...