hi Christian, thank you for your answer. To tell you the truth, my project mainly consists in testing the performances of various solvers and therefore recquires the use of the solver competition format xcsp, where the constraints are formulated in .xml files. As I did not intend to re-write every set of constraints for each solver, which would be both time consuming and performance altering, the only objective way of comparing the solvers was to give them the same input: the xcsp files. That's why I was wondering whether such a parser existed for Gecode. Cheers Nicolas -----E-mail d'origine----- De : Christian Schulte <[EMAIL PROTECTED]> A : [EMAIL PROTECTED]; [EMAIL PROTECTED] Envoyé le : Jeudi 28 Jui 2007 14:52 Sujet : RE: [gecode-users] xml (xcsp) constraints and gecode Hi Nicolas, what do you mean by xcsp? The solver competition format? Why don't you use something that is more accessible as an interface to Gecode: C++ (Gecode comes with many relevant standard benchmarks), Java through Gecode/J, or soon in Gecode 2.0 an interface to MiniZinc? Cheers Christian -- Christian Schulte, http://www.imit.kth.se/~schulte/
_______________________________________________ Gecode users mailing list [EMAIL PROTECTED] https://www.gecode.org/mailman/listinfo/gecode-users
