FD: Minimizing nondistinct

[Torsten Anders]

On Friday 06 September 2002 17:32, Denys Duchier wrote:
> t.anders at nici.kun.nl (Torsten Anders) writes:
> > in some FD problem I want to minimize the number of nondistinct
> > elements in a list.
>
> How about using a set and maximizing its cardinality?

Thank you. As I understand it so far, this will be a very good solution. 

But I did not yet succeed in constraining a FS var to include 
_and_only_include_ a given number of FD vars. (I did not do any FS constraint 
programming before, I therefore stumble over quite basic stuff I assume. But 
after searching doc for some hours...)

Could someone help, please?

Torsten Anders
-
Please send submissions to users at mozart-oz.org
and administriva mail to users-request at mozart-oz.org.
The Mozart Oz web site is at http://www.mozart-oz.org/.