Mats Carlsson

Re. usefulness, I thought it was common practice, or at least folklore, to use the intersection of regexps (the product of DFAs) to get a DC constraint over a sequence....

If you don't want to extend the regexp syntax, consider adding regexp combinator functions: ``` function string: regexp_intersection(string: r1, string: r2); function string: regexp_difference(string: r1, string: r2); ``` and optionally...

I wrote the issue from the perspective not of a solver implementor, but of a CP modeller. From the modeller's perspective, I find the behavior unexpected and nontrivial to work...

Here is the smallest model that I was able to find for this bug. ``` include "globals.mzn"; var 1..3: A; var 1..3: B; var 1..3: C; var 1..2: D; var...

Here is the smallest instance of this bug that I could find. ``` include "globals.mzn"; var 3..4: A; var {2,4}: D; var {2,4}: E; var 3..4: H; var {2,4}: I;...

Right. Nevertheless, convincing a beginner that the following makes sense is a bit of a challenge: ``` array[1..4] of bool: xa :: add_to_output = [true, true, false, false]; int: xlen...