From: Andre Trudel <andre.trudel_at_acadiau.ca>

Date: Wed 30 Apr 2003 04:58:44 PM GMT

Message-ID: <E607FA67F85FD311A7D400A024B226E106BF045F@exch.acadiau.ca>

Date: Wed 30 Apr 2003 04:58:44 PM GMT

Message-ID: <E607FA67F85FD311A7D400A024B226E106BF045F@exch.acadiau.ca>

I'm new to Eclipse. I'd like to use the system to solve traditional finite domain binary CSPs. I looked at the examples provided on the Eclipse site and still can't figure out how to implement a problem of the form: 3 variables X,Y,Z the domain of each variable is 1,2,3,4,5 the constraints are given as a subset of the Cartesian products of the domain: constraint between X and Y: {(1,1),(1,2),(3,1)} Y and Z: {(1,3),(2,3),(3,3)} Z and X: {(1,1),(2,2),(3,1),(4,4),(5,5)} How do I program Eclipse to return a solution of the form X=1,Y=2,Z=3? Any help would be appreciated. AndreReceived on Wed Apr 30 20:40:37 2003

*
This archive was generated by hypermail 2.1.8
: Wed 16 Nov 2005 06:07:23 PM GMT GMT
*