[gecode-users] Constraint deduction in Gecode

[Mauricio Toro]

Hello all,

I am trying to do logic deduction in Gecode and I do not know how to do it.
As an example, I have a,b,c as IntVars(0,100), d as BoolVar(0,1), and I have
the constraints
a > b, b> c and a > c <-> d. I want to be able to prove that a > c can be
deduced from a > b ^ b > c.

I tried using propagation and the value for d is [0..1].
I also tried using search (branching over d) and the answer is 1, but if I
change
the constraints to a > f, b > c and a > c <-> d, the answer
is also 1, which is not true in constraint deduction.

What can I do to implement the concept of constraint deduction in Gecode?

Cheers,
Mauricio

-- 
Mauricio TORO BERMUDEZ

http://www.labri.fr/perso/mtoro/

Invited Researcher
Pontificia Universidad Javeriana de Cali
Phone: +57 2 3218200

Research Postgraduate Student (Ph.D)
Computer Science Research Laboratory of Bordeaux (LABRI)
Université de Bordeaux 1

351, cours de la Libération
F-33405 Talence Cedex. France.
Phone: (+33) 5 4000 24 85
Fax: (+33) 5 4000 66 69

Please do not print this e-mail unless you really need to.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.gecode.org/pipermail/users/attachments/20110128/4401b576/attachment.htm>