Hi all,
I want to use a reification version of the extensional constraint, but I
think that it is not implemented in Gecode.
The chapter 24 explains how to implement a reification version of a
constraint, I understand that we need the negation of the automata DFA.
So, I want to know if there is an easy way to do this with extensional
constraint? If you have any details about this, it will be very helpful
for me.
Thanks.
Best regards,
---
Amina
_______________________________________________
Gecode users mailing list
users@gecode.org
https://www.gecode.org/mailman/listinfo/gecode-users
