Three Generalizations of the FOCUS Constraint
classification
💻 cs.AI
keywords
constraintfocusgeneralizationsthreealgorithmcompleteconcentrateddecompositions
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.