Revisiting Counting Solutions for the Global Cardinality Constraint

Counting solutions for a combinatorial problem has been identified as an important concern within the Artificial Intelligence field. It is indeed very helpful when exploring the structure of the solution space. In this context, this paper revisits the computation process to count solutions for the global cardinality constraint in the context of counting-based search. It first highlights an error and then presents a way to correct the upper bound on the number of solutions for this constraint.

[1]  Pascal Van Hentenryck,et al.  Activity-Based Search for Black-Box Constraint Programming Solvers , 2011, CPAIOR.

[2]  Annette Haworth,et al.  Optimised Robust Treatment Plans for Prostate Cancer Focal Brachytherapy , 2015, ICCS.

[3]  Wpm Wim Nuijten,et al.  Time and resource constrained scheduling : a constraint satisfaction approach , 1994 .

[4]  Alessandro Zanarini,et al.  Counting-Based Search: Branching Heuristics for Constraint Satisfaction Problems , 2012, J. Artif. Intell. Res..

[5]  Pascal Van Hentenryck.  Computational Disaster Management , 2013, IJCAI.

[6]  Jean-Charles Régin,et al.  Generalized Arc Consistency for Global Cardinality Constraint , 1996, AAAI/IAAI, Vol. 1.

[7]  Fengshan Bai,et al.  An upper bound for the permanent of (0,1)-matrices , 2004 .

[8]  Ye Tao,et al.  Through-the-Lens Scene Design , 2008, Smart Graphics.

[9]  Lakhdar Sais,et al.  Boosting Systematic Search by Weighting Constraints , 2004, ECAI.

[10]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[11]  Henryk Minc,et al.  Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices , 1963 .

[12]  John N. Hooker,et al.  Finding Alternative Musical Scales , 2016, CP.

[13]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[14]  Sharad Malik,et al.  Constrained Sampling and Counting: Universal Hashing Meets SAT Solving , 2015, AAAI Workshop: Beyond NP.

[15]  Philippe Refalo,et al.  Impact-Based Search Strategies for Constraint Programming , 2004, CP.

[16]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[17]  David Manlove,et al.  Position-Indexed Formulations for Kidney Exchange , 2016, EC.

[18]  Jörg Hoffmann,et al.  From Sampling to Model Counting , 2007, IJCAI.

[19]  Gérard Assayag,et al.  Constraint programming in music , 2011 .

[20]  Gilles Pesant,et al.  Accelerating Counting-Based Search , 2018, CPAIOR.

[21]  Shmuel Friedland.  An upper bound for the number of perfect matchings in graphs , 2008 .