10.4230/LIPICS.ICLP.2011.117
De Koninck, Leslie
Leslie
De Koninck
Brand, Sebastian
Sebastian
Brand
Stuckey, Peter J.
Peter J.
Stuckey
Constraints in Non-Boolean Contexts
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2011
Article
Constraint modelling languages
model transformation
partial functions
Gallagher, John P.
John P.
Gallagher
Gelfond, Michael
Michael
Gelfond
2011
2011-06-27
2011-06-27
2011-06-27
en
urn:nbn:de:0030-drops-31685
10.4230/LIPIcs.ICLP.2011
978-3-939897-31-6
1868-8969
10.4230/LIPIcs.ICLP.2011
LIPIcs, Volume 11, ICLP 2011
Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)
2013
11
12
117
127
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Gallagher, John P.
John P.
Gallagher
Gelfond, Michael
Michael
Gelfond
1868-8969
Leibniz International Proceedings in Informatics (LIPIcs)
2011
11
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
11 pages
498236 bytes
application/pdf
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of constraints on local variables in non-Boolean expressions. Specifications using these facilities are often more succinct. However, these specifications are typically executed on solvers that only support questions of the form of existentially quantified conjunctions of constraints.
We show how we can translate expressions with constraints appearing in non-Boolean contexts into conjunctions of ordinary constraints. The translation is clearly structured into constrained type elimination, local variable lifting and partial function elimination. We explain our approach in the context of the modelling language Zinc. An implementation of it is an integral part of our Zinc compiler.
LIPIcs, Vol. 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11), pages 117-127