joe.porter at gmail.com
Mon Apr 27 17:21:20 CEST 2009
I have a few questions about reification (I'm still using Gecode 2.2.0, but
will upgrade soon):
1. Can I do open-ended reification?
For example, if I post a linear constraint ((x=y+c) <=> ~b) and no alternate
(for b true) will this either assert the linear constraint or assert b, or
do I have to have another clause for the b case?
2. Can I use the same BoolVar to reify groups of contraints?
For example, if I have (xi=yi+c) for i=1..n, can I post them all with the
ISIS, Vanderbilt University
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the gecode-users