Hi,
I have a problem model where a list of FD integers is linked to a list
of FS's. I need to express that:
In the list FD1#FS1..FDn#FSn,
A) Cardinality of FS1..n (if non-empty) must be between minimum and
maximum boundaries. Otherwise the set must be empty. In effect what I'm
trying to achieve is (I think) {Or {FS.cardRange Min Max <set>} {FS.card
<set> 0}}. I know from trying this that it doesn't seem to be possible
to use such a construct within a solution script.
B) If a set is non-empty, then for every 'x' in the set, the cardinality
of the set corresponding to the item of the list where FDn==x is zero.
In other words if I had as one item of the list 3#{4 8 12} then the list
would also contain 4#{} 8#{} 12#{}. Ie 4, 8 and 12 must be mapped to
empty sets.
I have a feeling that this way of modelling my problem is just
impossible but I would appreciate comments from anyone before I scrap
the whole thing and start again.
Regards
Mark R
--
Mark Richardson MBCS
Research Assistant
University of Teesside, UK
Email: [email protected]
[email protected]
Skype: mark.richardson.
_________________________________________________________________________________
mozart-users mailing list
[email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-users
