Revisiting Counting Solutions for the Global Cardinality Constraint

Giovanni Lo Bianco, Xavier Lorca, Charlotte Truchet, Gilles Pesant

JAIR 2019 pp. 411-441

doi:10.1613/JAIR.1.11325 /jair/2019/bianco2019jair-revisiting/

Abstract

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.

PDF JAIR Semantic Scholar

Cite

Text

Bianco et al. "Revisiting Counting Solutions for the Global Cardinality Constraint." Journal of Artificial Intelligence Research, 2019. doi:10.1613/JAIR.1.11325

Markdown

[Bianco et al. "Revisiting Counting Solutions for the Global Cardinality Constraint." Journal of Artificial Intelligence Research, 2019.](https://mlanthology.org/jair/2019/bianco2019jair-revisiting/) doi:10.1613/JAIR.1.11325

BibTeX

@article{bianco2019jair-revisiting,
  title     = {{Revisiting Counting Solutions for the Global Cardinality Constraint}},
  author    = {Bianco, Giovanni Lo and Lorca, Xavier and Truchet, Charlotte and Pesant, Gilles},
  journal   = {Journal of Artificial Intelligence Research},
  year      = {2019},
  pages     = {411-441},
  doi       = {10.1613/JAIR.1.11325},
  volume    = {66},
  url       = {https://mlanthology.org/jair/2019/bianco2019jair-revisiting/}
}