Revisiting Counting Solutions for the Global Cardinality Constraint - IMT Mines Albi-Carmaux Accéder directement au contenu
Article Dans Une Revue Journal of Artificial Intelligence Research Année : 2019

Revisiting Counting Solutions for the Global Cardinality Constraint

Résumé

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.
Fichier principal
Vignette du fichier
Revisiting-counting-solutions-for-the-global-cardinality-constraint.pdf (855.78 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-02276554 , version 1 (26-11-2019)

Identifiants

Citer

Giovanni Lo Bianco, Xavier Lorca, Charlotte Truchet, Gilles Pesant. Revisiting Counting Solutions for the Global Cardinality Constraint. Journal of Artificial Intelligence Research, 2019, 66, pp.411-441. ⟨10.1613/jair.1.11325⟩. ⟨hal-02276554⟩
106 Consultations
74 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More