[gecode-users] Gecode/J arithmetic constraints

[Mikael De Bie]

Hi,

To post such a propagator, you can use the linear constraint :

linear(JavaSpace home, VarArray<? extends IntVar> array, IntRelType rel,
IntVar var)

In your case :

array is an array containing x and y

rel is IRT_EQ (for the equality)

var is z

I hope it'll help.

Cheers,

Mikael

PS : you can find the Gecode/J api here :
http://www.gecode.org/gecodej/javadoc/index.html

On Mon, 2007-04-02 at 17:56 +0200, Lars Frantzen wrote:
> Dear list,
> 
> I am new to constraint solving, to Gecode, and to this list, and have a
> quite basic question (I guess). I am mainly interested in my Ph.D.
> project in solving arithmetic constraints. I saw that Gecode offers here
> beside others "plus", "minus" and "sqr".
> 
> I cannot find those in Gecode/J. Do I miss something? I want to express
> a constraint like z = x + y (over finite domains).
> 
> Thanks and cheers,
> Lars
> 
> 
> 
> _______________________________________________
> Gecode users mailing list
> users at gecode.org
> https://www.gecode.org/mailman/listinfo/gecode-users