摘要：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.
其他摘要：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.
