Revisiting Counting Solutions for the Global Cardinality Constraint | Zendy

Giovanni Lo Bianco | Zendy; Xavier Lorca | Zendy; Charlotte Truchet | Zendy; Gilles Pesant | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Revisiting Counting Solutions for the Global Cardinality Constraint

Author(s) -

Giovanni Lo Bianco,

Xavier Lorca,

Charlotte Truchet,

Gilles Pesant

Publication year - 2019

Publication title -

journal of artificial intelligence research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.79

H-Index - 123

eISSN - 1943-5037

pISSN - 1076-9757

DOI - 10.1613/jair.1.11325

Subject(s) - cardinality (data modeling) , constraint (computer aided design) , context (archaeology) , counting problem , computation , field (mathematics) , computer science , process (computing) , space (punctuation) , theoretical computer science , mathematics , mathematical optimization , algorithm , data mining , geography , geometry , pure mathematics , operating system , archaeology

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research