Hi Denys, As someone that knows both mozart and gecode internals, I would like to ask for your opinion on the kind of integration that we are targeting. Of course one of the objectives is to use gecode to solve CSPs. This is what you offer for prolog and python and is also our first target for the new mozart. Another objective is to support writing branchers (or distributors) in Oz. One last objective is to bring support for the space combinators such as Or, Cond, etc.
Could you share your thoughts about this?. For the first part we do not need too much mozart-gecode interaction but for the others that is certainly the case. This is the part in which your experience with both systems could benefit us. Thanks in advance for any comment/suggestion! Gustavo 2012/3/11 Denys Duchier <denys.duch...@univ-orleans.fr> > Torsten Anders <torsten.and...@plymouth.ac.uk> writes: > > > I only have a brief question concerning your prolog and python bindings: > Your > > prolog bindings doc says "all constraint and branching posting functions > are > > available just like in Gecode". Does that mean branchings (distribution > > strategies) can be freely defined with these (as in Mozart 1.*)? > > Hi Torsten, (it's been a while) > > no, it means that all the _predefined_ constants, constraints and > branchings are available. additional functionality gets into these > bindings when someone needs it and I have time to implement it :-) > >
_________________________________________________________________________________ mozart-hackers mailing list mozart-hackers@mozart-oz.org http://www.mozart-oz.org/mailman/listinfo/mozart-hackers
