Three generalizations of the FOCUS constraint
Refereed Original Article
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. Moreover, we propose ILP and CSP decompositions.
Digital Object Identifer (DOI):
Date Accepted for Publication:
Tuesday, 27 October, 2015
National University of Ireland, Cork (UCC)
Open access repository: