Abstract
The F OCUS 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 F OCUS constraint. We provide for each one a complete filtering algorithm as well as discussing decompositions.