[gecode-users] algorithm used in sequence constraint

[Kish Shen]

Hi,

This is actually a new question about the sequence constraint: there 
seem to be two versions  of the constraint, one for IntVars, and one for 
BoolVars, but the other arguments are the same. Specifically, the 
BoolVar version has the IntSet s of values that each sequence of 
variables should take. I don't understand how this works for BoolVars, 
since they can only take 0 or 1 as values. What exactly is the semantics 
for the BoolVar version?

In the ECLiPSe versions of the constraint, there is also a version that 
has boolean variables. In this version, there is no equivalent to the 
IntSet s, so it has one less argument than the IntVar version. Each 
sequence of q variables must have between l and u variables with the 
value 1. Is this the semantics for the gecode version as well?

Cheers,

Kish

-- 
This e-mail may contain confidential and privileged material for the
sole use of the intended recipient. Any review, use, distribution or
disclosure by others is strictly prohibited. If you are not the intended
recipient (or authorized to receive for the recipient), please contact
the sender by reply e-mail and delete all copies of this message.
Cisco Systems Limited (Company Number: 02558939), is registered in
England and Wales with its registered office at 1 Callaghan Square,
Cardiff, South Glamorgan CF10 5BT.