66 search results - page 5 / 14 » cp 2010 |
CP
2010
Springer
13 years 7 months ago
2010
Springer
Research on constraint propagation has primarily focused on designing polynomial-time propagators sometimes at the cost of a weaker filtering. Interestingly, the evolution of cons...
CP
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...
CP
2010
Springer
13 years 7 months ago
2010
Springer
A new interval constraint propagation algorithm, called MOnotonic Hull Consistency (Mohc), has recently been proposed. Mohc exploits monotonicity of functions to better filter var...
CP
2010
Springer
13 years 7 months ago
2010
Springer
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
CP
2010
Springer
13 years 6 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...