Compiling conditional constraints

Peter J. Stuckey; Guido Tack

doi:10.1007/978-3-030-30048-7_23

Compiling conditional constraints

Peter J. Stuckey, Guido Tack

Department of Data Science & AI

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

1 Citation (Scopus)

Abstract

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 language	English
Title of host publication	Principles and Practice of Constraint Programming
Subtitle of host publication	25th International Conference, CP 2019 Stamford, CT, USA, September 30 – October 4, 2019 Proceedings
Editors	Thomas Schiex, Simon de Givry
Place of Publication	Cham Switzerland
Publisher	Springer
Pages	384-400
Number of pages	17
ISBN (Electronic)	9783030300487
ISBN (Print)	9783030300470
DOIs	https://doi.org/10.1007/978-3-030-30048-7_23
Publication status	Published - 2019
Event	International Conference on Principles and Practice of Constraint Programming 2019 - Stamford, United States of America Duration: 30 Sept 2019 → 4 Oct 2019 Conference number: 25th https://cp2019.a4cp.org/

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	11802
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	International Conference on Principles and Practice of Constraint Programming 2019
Abbreviated title	CP 2019
Country/Territory	United States of America
City	Stamford
Period	30/09/19 → 4/10/19
Internet address	https://cp2019.a4cp.org/

Keywords

Conditional constraints
Constraint modelling
MiniZinc

Access to Document

10.1007/978-3-030-30048-7_23

Cite this

Stuckey, P. J., & Tack, G. (2019). Compiling conditional constraints. In T. Schiex, & S. de Givry (Eds.), Principles and Practice of Constraint Programming : 25th International Conference, CP 2019 Stamford, CT, USA, September 30 – October 4, 2019 Proceedings (pp. 384-400). (Lecture Notes in Computer Science ; Vol. 11802 ). Springer. https://doi.org/10.1007/978-3-030-30048-7_23

@inproceedings{2c825874f9c94aaca32ac27e2fb717be,

title = "Compiling conditional constraints",

abstract = "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.",

keywords = "Conditional constraints, Constraint modelling, MiniZinc",

author = "Stuckey, {Peter J.} and Guido Tack",

year = "2019",

doi = "10.1007/978-3-030-30048-7_23",

language = "English",

isbn = "9783030300470",

series = "Lecture Notes in Computer Science ",

publisher = "Springer",

pages = "384--400",

editor = "Thomas Schiex and {de Givry}, Simon",

booktitle = "Principles and Practice of Constraint Programming",

note = "International Conference on Principles and Practice of Constraint Programming 2019, CP 2019 ; Conference date: 30-09-2019 Through 04-10-2019",

url = "https://cp2019.a4cp.org/",

}

Stuckey, PJ & Tack, G 2019, Compiling conditional constraints. in T Schiex & S de Givry (eds), Principles and Practice of Constraint Programming : 25th International Conference, CP 2019 Stamford, CT, USA, September 30 – October 4, 2019 Proceedings. Lecture Notes in Computer Science , vol. 11802 , Springer, Cham Switzerland, pp. 384-400, International Conference on Principles and Practice of Constraint Programming 2019, Stamford, Connecticut, United States of America, 30/09/19. https://doi.org/10.1007/978-3-030-30048-7_23

Compiling conditional constraints. / Stuckey, Peter J.; Tack, Guido.
Principles and Practice of Constraint Programming : 25th International Conference, CP 2019 Stamford, CT, USA, September 30 – October 4, 2019 Proceedings. ed. / Thomas Schiex; Simon de Givry. Cham Switzerland: Springer, 2019. p. 384-400 (Lecture Notes in Computer Science ; Vol. 11802 ).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Compiling conditional constraints

AU - Stuckey, Peter J.

AU - Tack, Guido

N1 - Conference code: 25th

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

KW - Conditional constraints

KW - Constraint modelling

KW - MiniZinc

UR - http://www.scopus.com/inward/record.url?scp=85075745006&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-30048-7_23

DO - 10.1007/978-3-030-30048-7_23

M3 - Conference Paper

AN - SCOPUS:85075745006

SN - 9783030300470

T3 - Lecture Notes in Computer Science

SP - 384

EP - 400

BT - Principles and Practice of Constraint Programming

A2 - Schiex, Thomas

A2 - de Givry, Simon

PB - Springer

CY - Cham Switzerland

T2 - International Conference on Principles and Practice of Constraint Programming 2019

Y2 - 30 September 2019 through 4 October 2019

ER -

Compiling conditional constraints

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Learning from learning solvers

Cite this

Compiling conditional constraints

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Projects

Learning from learning solvers

Cite this