Automatic generation and selection of streamlined constraint models via Monte Carlo search on a model lattice

Patrick Spracklen; Ozgur Akgun; Ian James Miguel

doi:10.1007/978-3-319-98334-9_24

Automatic generation and selection of streamlined constraint models via Monte Carlo search on a model lattice

Patrick Spracklen, Ozgur Akgun, Ian James Miguel

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to reduce the search space, while retaining at least one solution. Previously it has been established that it is possible to generate streamliners automatically from abstract constraint specifications in Essence and that effective combinations of streamliners can allow instances of much larger scale to be solved. A shortcoming of the previous approach was the crude exploration of the power set of all combinations using depth and breadth first search. We present a new approach based on Monte Carlo search over the lattice of streamlined models, which efficiently identifies effective streamliner combinations.

Original language	English
Title of host publication	Principles and Practice of Constraint Programming
Subtitle of host publication	24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings
Editors	John Hooker
Place of Publication	Cham
Publisher	Springer
Pages	362-372
ISBN (Electronic)	9783319983349
ISBN (Print)	9783319983332
DOIs	https://doi.org/10.1007/978-3-319-98334-9_24
Publication status	Published - 2018

Publication series

Name	Lecture Notes in Computer Science (including subseries Programming and Software Engineering)
Publisher	Springer
Volume	11008 LNCS
ISSN (Print)	0302-9743

Access to Document

10.1007/978-3-319-98334-9_24

CRC
Copyright © 2018, Springer Nature Switzerland AG. This work has been made available online in accordance with the publisher’s policies. This is the author created accepted version manuscript following peer review and as such may differ slightly from the final published version. The final published version of this work is available at https://doi.org/10.1007/978-3-319-98334-9_24
Accepted author manuscript, 235 KB

Ozgur Akgun
- ozgur.akgunst-andrews.acuk
- School of Computer Science - Senior Lecturer, Director of Impact
- Centre for Interdisciplinary Research in Computational Algebra
Person: Academic

Cite this

Spracklen, P., Akgun, O., & Miguel, I. J. (2018). Automatic generation and selection of streamlined constraint models via Monte Carlo search on a model lattice. In J. Hooker (Ed.), Principles and Practice of Constraint Programming: 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings (pp. 362-372). (Lecture Notes in Computer Science (including subseries Programming and Software Engineering); Vol. 11008 LNCS). Springer. https://doi.org/10.1007/978-3-319-98334-9_24

Spracklen, Patrick ; Akgun, Ozgur ; Miguel, Ian James. / Automatic generation and selection of streamlined constraint models via Monte Carlo search on a model lattice. Principles and Practice of Constraint Programming: 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings. editor / John Hooker. Cham : Springer, 2018. pp. 362-372 (Lecture Notes in Computer Science (including subseries Programming and Software Engineering)).

@inproceedings{6eef5285c1a0471ebba55a9179298de8,

title = "Automatic generation and selection of streamlined constraint models via Monte Carlo search on a model lattice",

abstract = "Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to reduce the search space, while retaining at least one solution. Previously it has been established that it is possible to generate streamliners automatically from abstract constraint specifications in Essence and that effective combinations of streamliners can allow instances of much larger scale to be solved. A shortcoming of the previous approach was the crude exploration of the power set of all combinations using depth and breadth first search. We present a new approach based on Monte Carlo search over the lattice of streamlined models, which efficiently identifies effective streamliner combinations.",

author = "Patrick Spracklen and Ozgur Akgun and Miguel, {Ian James}",

note = "Funding: EPSRC EP/P015638/1.",

year = "2018",

doi = "10.1007/978-3-319-98334-9_24",

language = "English",

isbn = "9783319983332",

series = "Lecture Notes in Computer Science (including subseries Programming and Software Engineering)",

publisher = "Springer",

pages = "362--372",

editor = "John Hooker",

booktitle = "Principles and Practice of Constraint Programming",

address = "Netherlands",

}

Spracklen, P, Akgun, O & Miguel, IJ 2018, Automatic generation and selection of streamlined constraint models via Monte Carlo search on a model lattice. in J Hooker (ed.), Principles and Practice of Constraint Programming: 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings. Lecture Notes in Computer Science (including subseries Programming and Software Engineering), vol. 11008 LNCS, Springer, Cham, pp. 362-372. https://doi.org/10.1007/978-3-319-98334-9_24

Automatic generation and selection of streamlined constraint models via Monte Carlo search on a model lattice. / Spracklen, Patrick; Akgun, Ozgur ; Miguel, Ian James.
Principles and Practice of Constraint Programming: 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings. ed. / John Hooker. Cham: Springer, 2018. p. 362-372 (Lecture Notes in Computer Science (including subseries Programming and Software Engineering); Vol. 11008 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Automatic generation and selection of streamlined constraint models via Monte Carlo search on a model lattice

AU - Spracklen, Patrick

AU - Akgun, Ozgur

AU - Miguel, Ian James

N1 - Funding: EPSRC EP/P015638/1.

PY - 2018

Y1 - 2018

N2 - Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to reduce the search space, while retaining at least one solution. Previously it has been established that it is possible to generate streamliners automatically from abstract constraint specifications in Essence and that effective combinations of streamliners can allow instances of much larger scale to be solved. A shortcoming of the previous approach was the crude exploration of the power set of all combinations using depth and breadth first search. We present a new approach based on Monte Carlo search over the lattice of streamlined models, which efficiently identifies effective streamliner combinations.

AB - Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to reduce the search space, while retaining at least one solution. Previously it has been established that it is possible to generate streamliners automatically from abstract constraint specifications in Essence and that effective combinations of streamliners can allow instances of much larger scale to be solved. A shortcoming of the previous approach was the crude exploration of the power set of all combinations using depth and breadth first search. We present a new approach based on Monte Carlo search over the lattice of streamlined models, which efficiently identifies effective streamliner combinations.

U2 - 10.1007/978-3-319-98334-9_24

DO - 10.1007/978-3-319-98334-9_24

M3 - Conference contribution

SN - 9783319983332

T3 - Lecture Notes in Computer Science (including subseries Programming and Software Engineering)

SP - 362

EP - 372

BT - Principles and Practice of Constraint Programming

A2 - Hooker, John

PB - Springer

CY - Cham

ER -

Spracklen P, Akgun O , Miguel IJ. Automatic generation and selection of streamlined constraint models via Monte Carlo search on a model lattice. In Hooker J, editor, Principles and Practice of Constraint Programming: 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings. Cham: Springer. 2018. p. 362-372. (Lecture Notes in Computer Science (including subseries Programming and Software Engineering)). Epub 2018 Aug 23. doi: 10.1007/978-3-319-98334-9_24

Automatic generation and selection of streamlined constraint models via Monte Carlo search on a model lattice

Abstract

Publication series

Access to Document

Fingerprint

Profiles

Ozgur Akgun

Cite this