Work

Expressive models for Monadic Constraint Programming

Year: 2010
Type: conference-paper
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 in-efficiencies that high-level modeling typically introduces. Problems can be solved directly at run-time, or translated to C++ code for later solv-ing. Benchmarks show that solving efficiency approximates that of hand-coded Gecode programs. 1
Source: Lirias
Institution: KU Leuven
Language: English
Open Access status: green
OpenAlex ID: W2522150609
FWCI: 0.499
Cites: 6
Cited by: 3
Related to: 10