Sciweavers

CP
2005
Springer
13 years 10 months ago
Towards the Systematic Generation of Channelling Constraints
Abstract. The automatic modelling tool Conjure generates CSP models from problem specifications. The generated models may contain multiple alternative (redundant) representations ...
Bernadette Martínez Hernández, Alan ...
CP
2005
Springer
13 years 10 months ago
Local Consistency in Weighted CSPs and Inference in Max-SAT
In this paper we overview our recent work and outline our current line of research: First, we describe the WCSP framework and its related local consistencies. Second, the Max-SAT p...
Federico Heras, Javier Larrosa
CP
2005
Springer
13 years 10 months ago
Using Constraint Programming for Solving Distance CSP with Uncertainty
Many problems in chemistry, robotics or molecular biology can be expressed as a Distance CSP4 . In this paper, we propose a specific methodology for tackling uncertainties in this...
Carlos Grandón, Bertrand Neveu
CP
2005
Springer
13 years 10 months ago
Symmetry and Consistency
We introduce a novel and exciting research area: symmetrising levels of consistency to produce stronger forms of consistency and more efficient mechanisms for establishing them. W...
Ian P. Gent, Tom Kelsey, Steve Linton, Colva M. Ro...
CP
2005
Springer
13 years 10 months ago
Conditional Symmetry Breaking
Conditional symmetry arises in a sub-problem of a constraint satisfaction problem, where the sub-problem satisfies some condition under which additional symetries hold. Typically...
Ian P. Gent, Tom Kelsey, Steve Linton, Iain McDona...
CP
2005
Springer
13 years 10 months ago
Tractable Clones of Polynomials over Semigroups
Víctor Dalmau, Ricard Gavaldà, Pasca...
CP
2005
Springer
13 years 10 months ago
Automated Search for Heuristic Functions
Pavel Cejnar, Roman Barták
CP
2005
Springer
13 years 10 months ago
Scheduling Social Tournaments
Iván Dotú, Alvaro del Val, Pascal Va...
CP
2005
Springer
13 years 10 months ago
CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
Grégoire Dooms, Yves Deville, Pierre Dupont