We present the current state of a new implementation of the constraint engine for the Mozart programming system. Our implementation integrates the Gecode constraint library into the core of Mozart version 2.0. Doing so, we allow users to take advantage of the eciency of Gecode propagators transparently by maintaining the existing language constraints abstractions. Future Mozart systems can thus benet from the rapid pace of constraint solving optimizations that are included in each new Gecode version. We use two well-known puzzles to illustrate the system and present all available abstractions
Gutierrez Sabogal, G. A., Barco, A. F., Villanueva, M. A., Cardona, A., Montenegro, D., Miller, S., Diaz, J. F., Rueda, C., & Van Roy, P. (2013). The Mozart constraint subsystem : system presentation. Workshop on Techniques for Implementing Constraint Programming Systems, Uppsala, Sweden. https://hdl.handle.net/2078.5/40608