2026-07-22T21:01:31Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6743 2024-03-06T10:29:57Z ddc:004 open_access

Constraint Propagation and Explanation over Novel Types by Abstract Compilation Gange, Graeme Stuckey, Peter J. constraint programming program synthesis program analysis The appeal of constraint programming (CP) lies in compositionality – the ability to mix and match constraints as needed. However, this flexibility typically does not extend to the types of variables. Solvers usually support only a small set of pre-defined variable types, and extending this is not typically a simple exercise: not only must the solver engine be updated, but then the library of supported constraints must be re-implemented to support the new type. In this paper, we attempt to ease this second step. We describe a system for automatically deriving a native-code implementation of a global constraint (over novel variable types) from a declarative specification, complete with the ability to explain its propagation, a requirement if we want to make use of modern lazy clause generation CP solvers. We demonstrate this approach by adding support for wrapped-integer variables to chuffed, a lazy clause generation CP solver. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Graeme Gange and Peter J. Stuckey 2016 Is Part Of OASIcs, Volume 52, Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ICLP.2016.13 urn:nbn:de:0030-drops-67437 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.13 eng https://creativecommons.org/licenses/by/3.0/legalcode