{"type":"ScholarlyArticle","title":"Three Generalizations of the FOCUS Constraint","authors":[{"name":"Nina Narodytska","slug":"nina-narodytska","given":"Nina","family":"Narodytska","affiliation":"NICTA and UNSW Sydney , Australia"},{"name":"Thierry Petit","slug":"thierry-petit","given":"Thierry","family":"Petit","affiliation":"LINA-CNRS Mines-Nantes , INRIA Nantes , France"},{"name":"Mohamed Siala","slug":"mohamed-siala","given":"Mohamed","family":"Siala","affiliation":"LAAS - CNRS Univ de Toulouse , INSA Toulouse , France"},{"name":"Toby Walsh","slug":"toby-walsh","given":"Toby","family":"Walsh","affiliation":"NICTA and UNSW Sydney , Australia"}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2013/100","pdf":"https://ijcai.org/proceedings/2013/0100.pdf","markdown":"https://ijcai.org/proceedings/2013/100.md","bibtex":"https://ijcai.org/proceedings/2013/bibtex/100","volume":{"slug":"2013","title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2013","url":"https://ijcai.org/proceedings/2013/","year":2013,"location":"Beijing, China","dates":"3–9 August 2013","editors":"Francesca Rossi","isbn":"978-1-57735-633-2","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":100,"pages":{"first":630,"last":635},"keywords":[],"videos":[],"references":[{"position":1,"raw":"FILTERING(X, yc , len, k , h): Set of variables 1 pre := MINCARDS(X, len, k, h) ; 2 Integer lb := min(pre-1]","title":"Set of variables 1 pre := MINCARDS(X, len","authors":"Filtering(x","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"if min(yc ) < lb then D(yc ) := D(yc ) \\ [min(yc ), lb[; (yc )","title":"lb then D(yc","authors":null,"year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Dasgupta et al., 2006] S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani. Algorithms. McGraw-Hill, 2006.","title":"Algorithms","authors":"S Dasgupta, C H Papadimitriou, U V Vazirani","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[De Clercq et al., 2011] A. De Clercq, T. Petit, N. Beldiceanu, and N. Jussien. Filtering algorithms for discrete cumulative problems with overloads of resource. In Proc. CP, pages 240-255, 2011.","title":"Filtering algorithms for discrete cumulative problems with overloads of resource","authors":"De Clercq","year":"2011","venue":"Proc. CP","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Narodytska et al., 2013] N. Narodytska, T. Petit, M. Siala, and T. Walsh. Three generalizations of the focus con- straint. Technical report, Avalaible online from CoRR, 2013.","title":"Three generalizations of the focus constraint","authors":"N Narodytska, T Petit, M Siala, T Walsh","year":"2013","venue":"Avalaible online from CoRR","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Pesant and Régin, 2005] G. Pesant and J.-C. Régin. Spread: A balancing constraint based on statistics. In Proc. CP, pages 460-474, 2005.","title":"Spread: A balancing constraint based on statistics","authors":"G Pesant, J.-C Régin","year":"2005","venue":"Proc. CP","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Petit and Poder, 2008] T. Petit and E. Poder. Global propa- gation of practicability constraints. In Proc. CPAIOR, vol- ume 5015, pages 361-366, 2008.","title":"Global propagation of practicability constraints","authors":"T Petit, E Poder","year":"2008","venue":"Proc. CPAIOR","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Petit and Régin, 2011] T. Petit and J.-C. Régin. The ordered distribute constraint. International Journal on Artificial Intelligence Tools, 20(4):617-637, 2011.","title":"The ordered distribute constraint","authors":"T Petit, J.-C Régin","year":"2011","venue":"International Journal on Artificial Intelligence Tools","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Petit, 2012] T. Petit. Focus: A constraint for concentrating high costs. In Proc. CP, pages 577-592, 2012.","title":"Focus: A constraint for concentrating high costs","authors":"T Petit","year":"2012","venue":"Proc. CP","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Régin, 1996] J.-C. Régin. Generalized arc consistency for global cardinality constraint. In Proceedings of the 14th National Conference on Artificial intelligence (AAAI'98), pages 209-215, 1996.","title":"Generalized arc consistency for global cardinality constraint","authors":"J.-C Régin","year":"1996","venue":"Proceedings of the 14th National Conference on Artificial intelligence (AAAI'98)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Schaus et al., 2007] P. Schaus, Y. Deville, P. Dupont, and J-C. Régin. The deviation constraint. In Proc. CPAIOR, volume 4510, pages 260-274, 2007.","title":"The deviation constraint","authors":"P Schaus, Y Deville, P Dupont, J-C Régin","year":"2007","venue":"Proc. CPAIOR","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[and thus some harder ones) should be penalized. Schaus et al., 2009] P. Schaus, P. Van Hentenryck, and J-C. Régin. Scalable load balancing in nurse to patient assign- ment problems. In Proc. CPAIOR, volume 5547, pages 248-262, 2009.","title":"Scalable load balancing in nurse to patient assignment problems","authors":"P Schaus, P Van Hentenryck, J-C Régin","year":"2009","venue":"Proc. CPAIOR","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}