Hi, I am trying to use Finite Domain Constraint Programming in Mozart to solve CSP instances by exploiting symmetries of the problem ( a la Puget). I have two problems : 1- I want to add constraints dyamically to the problem and not only post them at the beginning of the problem (as explained in section 4 of the Finite Domain Constraint Programming tutorial); 2- At each node of the search tree I want to access to each value of each unbound variable and have the possibility to remove some values. I looked for in the tutorial but I don't find any similar topic.
Thanks in advance Réda _________________________________________________________________________________ mozart-users mailing list [email protected] http://www.mozart-oz.org/mailman/listinfo/mozart-users
