Hi Christina, I am trying to do the exact same thing. The only way I know how to do this is with constraint handling rules. When a constraint is violated you can detect it and react. I am still trying to learn how to do this well with Eclipse. Look at this web page: http://eclipse.crosscoreoptimization.com/reports/eclipse/node22.html I have been wanting to even hire a tutor to help me understand this but haven't had any luck so far. One question I am having right now is how to test if a value or domain intersects another domain, do you know how to do this? On 12/2/06, marconci_at_sci.univr.it <marconci_at_sci.univr.it> wrote: > > > Hi everybody, > > I am writing a program with a set of constraints that use > the ic library and finally the search functions > search(L,0,input_order,indomain_random,complete,[]). > > Sometimes, it may happen that at some point > my program fails giving no solution. > > I would like to find which goal failed, to > do some more in depth search, i.e. refining > some constraints, by exploiting this information. > > Is there a method to get this information from > inside the program, without using the tracer? > > I have found a question on the same problem in the mailing list, here > http://eclipse.crosscoreop.com/archive/eclipse-users/0838.html > but I have not found the replays. > > Any tips on the problem would be wellcome. > > Thank you very much > > Cristina > > > > > > > _______________________________________________ > ECLiPSe-Users mailing list > ECLiPSe-Users_at_crosscoreop.com > http://www.crosscoreop.com/mailman/listinfo/eclipse-users >Received on Sat Dec 02 2006 - 23:46:53 CET
This archive was generated by hypermail 2.2.0 : Thu Feb 02 2012 - 02:31:57 CET