|
Class Summary |
| AbstractBinSetConstraint |
|
| AbstractBinSetIntConstraint |
|
| AbstractMixedConstraint |
A class for mixed set and int constraint. |
| AbstractSetConstraint |
|
| AbstractTernSetConstraint |
|
| AbstractUnSetConstraint |
|
| Disjoint |
A constraint stating that two sets have to be disjoint :
It is based on two propagation rules :
Env(v1) disjoint Ker(v2)
Env(v2) disjoint Ker(v1) |
| MemberX |
Enforce a value to belong to a setVar |
| MemberXY |
Ensure that an int variable belongs to a set variable |
| NotMemberX |
Ensure that a value will not belong to a setVar |
| NotMemberXY |
Ensure that an int variable does not belong to a set variable |
| SetCard |
|
| SetIntersection |
A constraint stating that a set is the intersection of two others
There are seven propagation rules for the constraint sv3 = intersection(sv1, sv2)
Ker(sv1) contains Ker(sv3)
Ker(sv2) contains Ker(sv3)
Ker(sv3) contains (Ker(sv1) inter Ker(sv2))
Env(v3) disjoint Complement(Env(v1))
Env(v3) disjoint Complement(Env(v2))
Env(v2) disjoint Ker(v1) inter Complement(Env(v3))
Env(v1) disjoint Ker(v2) inter Complement(Env(v3)) |