Compiling conditional constraints

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

1 Citation (Scopus)


Conditionals are a core concept in all programming languages. They are also a natural and powerful mechanism for expressing complex constraints in constraint modelling languages. The behaviour of conditionals is complicated by undefinedness. In this paper we show how to most effectively translate conditional constraints for underlying solvers. We show that the simple translation into implications can be improved, at least in terms of reasoning strength, for both constraint programming and mixed integer programming solvers. Unit testing shows that the new translations are more efficient, but the benefits are not so clear on full models where the interaction with other features such as learning is more complicated.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming
Subtitle of host publication25th International Conference, CP 2019 Stamford, CT, USA, September 30 – October 4, 2019 Proceedings
EditorsThomas Schiex, Simon de Givry
Place of PublicationCham Switzerland
Number of pages17
ISBN (Electronic)9783030300487
ISBN (Print)9783030300470
Publication statusPublished - 2019
EventInternational Conference on Principles and Practice of Constraint Programming 2019 - Stanford, Stamford, United States of America
Duration: 30 Sep 20194 Oct 2019
Conference number: 25th

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceInternational Conference on Principles and Practice of Constraint Programming 2019
Abbreviated titleCP 2019
Country/TerritoryUnited States of America
Internet address


  • Conditional constraints
  • Constraint modelling
  • MiniZinc

Cite this