Just for your info: taking the algorithms from Gecode to Mozart is almost
impossible (unless you completely rewrite). This is due to the fact that
Mozart's CPI is quite limited compared to Gecode (no incremental
propagation, only idempotent propagators supported, no staging, eager
fixpoint computation, etc).
What a shameless advertisement! ;-)
I did not think that the *code* could be used, just the algorithms (the
papers on which the code is based are surely available somewhere, I've
seen some pdfs). Yet another option is that Mozart could use an external
Gecode-based constraint solver. :-)
BTW, we're developing quite large server application in Oz now, and the
biggest problem is the lack of type checking. I've created some
"preprocessor sed scripts" that do some compile-time typechecking that
relies on the static analysis compiler phase, but this is still far from
C++.
Cheers,
Filip
_________________________________________________________________________________
mozart-hackers mailing list [email protected]
http://www.mozart-oz.org/mailman/listinfo/mozart-hackers
