Abstract. This paper presents a new FD-specific modeling front-end for the Monadic Constraint Programming framework for Haskell. A more declarative interface was introduced, supporting reified constraints among others, as well as an optimizing compilation scheme to prevent the inefficiencies that high-level modeling typically introduces. Problems can be solved directly at run-time, or translated to C ++ code for later solving. Benchmarks show that solving efficiency approximates that of handcoded Gecode programs.
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.