AIApr 22, 2013
Three Generalizations of the FOCUS Constraint
arXiv:1304.5970v1
Originality Synthesis-oriented
AI Analysis
This work addresses a specific issue in constraint programming for researchers in that field, but appears incremental as it builds directly on existing FOCUS constraint concepts.
The authors tackled the rigidity of the FOCUS constraint by proposing three generalizations, providing complete filtering algorithms and discussing decompositions for each.
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.