Three Generalizations of the FOCUS Constraint

04/22/2013
by   Nina Narodytska, et al.
0

The FOCUS constraint expresses the notion that solutions are concentrated. In practice, this constraint suffers from the rigidity of its semantics. To tackle this issue, we propose three generalizations of the FOCUS constraint. We provide for each one a complete filtering algorithm as well as discussing decompositions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/22/2014

Dynamic Sweep Filtering Algorithm for FlexC

We investigate cumulative scheduling in uncertain environments, using co...
research
01/21/2021

Quantum Constraint Problems can be complete for 𝖡𝖰𝖯, 𝖰𝖢𝖬𝖠, and more

A quantum constraint problem is a frustration-free Hamiltonian problem: ...
research
01/15/2014

Exploiting Single-Cycle Symmetries in Continuous Constraint Problems

Symmetries in discrete constraint satisfaction problems have been explor...
research
11/28/2016

The BIN_COUNTS Constraint: Filtering and Applications

We introduce the BIN_COUNTS constraint, which deals with the problem of ...
research
09/05/2015

A commentary on "The now-or-never bottleneck: a fundamental constraint on language", by Christiansen and Chater (2016)

In a recent article, Christiansen and Chater (2016) present a fundamenta...
research
07/08/2016

Solving finite-domain linear constraints in presence of the alldifferent

In this paper, we investigate the possibility of improvement of the wide...

Please sign up or login with your details

Forgot password? Click here to reset