Sciweavers

CP
2010
Springer
13 years 10 months ago
Local Consistency and SAT-Solvers
In this paper we show that the power of using k-consistency techniques in a constraint problem is precisely captured by using a particular inference rule, which we call positive-hy...
Justyna Petke, Peter Jeavons
CP
2010
Springer
13 years 10 months ago
Testing Expressibility Is Hard
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...
Ross Willard
CP
2010
Springer
13 years 10 months ago
A Box-Consistency Contractor Based on Extremal Functions
Abstract. Interval-based methods can approximate all the real solutions of a system of equations and inequalities. The Box interval constraint propagation algorithm enforces Box co...
Gilles Trombettoni, Yves Papegay, Gilles Chabert, ...
CP
2010
Springer
13 years 10 months ago
Making Adaptive an Interval Constraint Propagation Algorithm Exploiting Monotonicity
A new interval constraint propagation algorithm, called MOnotonic Hull Consistency (Mohc), has recently been proposed. Mohc exploits monotonicity of functions to better filter var...
Ignacio Araya, Gilles Trombettoni, Bertrand Neveu
CP
2010
Springer
13 years 10 months ago
Load Balancing and Almost Symmetries for RAMBO Quorum Hosting
Abstract. Rambo is the Reconfigurable Atomic Memory for Basic Objects, a formally specified algorithm that implements atomic read/write shared memory in dynamic networks, where t...
Laurent Michel, Alexander A. Shvartsman, Elaine L....
CP
2010
Springer
13 years 10 months ago
Checking-Up on Branch-and-Check
Abstract. Branch-and-Check, introduced ten years ago, is a generalization of logic-based Benders decomposition. The key extension is to solve the Benders sub-problems at each feasi...
J. Christopher Beck
CP
2010
Springer
13 years 10 months ago
Exponential Propagation for Set Variables
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...
Justin Yip, Pascal Van Hentenryck
CP
2010
Springer
13 years 10 months ago
Computing the Density of States of Boolean Formulas
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...
Stefano Ermon, Carla P. Gomes, Bart Selman
CP
2010
Springer
13 years 10 months ago
A Generic Visualization Platform for CP
In this paper we describe the design and implementation of CP-VIZ, a generic visualization platform for constraint programming. It provides multiple views to show the search tree, ...
Helmut Simonis, Paul Davern, Jacob Feldman, Deepak...