2009/4/27 Joe Porter :
> I have a few questions about reification (I'm still using Gecode 2.2.0, but
> 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
Actually, for 2. this is used: suppose you want express logical equivalence
by reification, say (xmailto:users-boun...@gecode.org] On Behalf
Of Joe Porter
Sent: Monday, April 27, 2009 7:16 PM
To: us...@gecode.org
Subject: Re: [gecode-users] Reification
1. It is really an equivalence
> 1. It is really an equivalence: so what it actually says (your
> example slightly simplified) is (x != y+c) ó b=1. If b=0 it will assert x
> == y+c, and if b=1 it will assert x != y+c. I am not sure whether this
> answers your question.
>
That's exactly what I wanted -- to use the boolean
Hi,
1. It is really an equivalence: so what it actually says (your example
slightly simplified) is (x != y+c) ó b=1. If b=0 it will assert x == y+c,
and if b=1 it will assert x != y+c. I am not sure whether this answers your
question.
2. Well depends on what you want to express, wh
