The goal is to translate high-level constraint satisfaction and optimization problems into any lower-level formalism, including CP, SMT QF-LIA, ILP, PB and (Max)SAT, and to present a modular framework for transforming the high-level modeling language to CP/SMT/ILP/PB and (Max)SAT solvers.
Tias Guns, Ignace Bleukx, H. Bierlee et al.· 0 citations
A set of reformulation rules are proposed that allow the use of half-reification of a global constraint with any CP solver that supports the “normal” global constraint propagator, and expand the range of available solvers and constraint models that can be used in XCP techniques or for solving CSPs with compound constra...
Ignace Bleukx, Hélène Verhaeghe, Dimos Tsouros et al.· Journal of Artificial Intell...· 1 citation
Combinatorial problems appear in numerous industrial applications. A common approach is to formulate these problems as declarative constraint models that can subsequently be compiled to and solved by a range of back-end solvers. Recent work shows that Large Language Models (LLMs) can produce correct models from natural...