Show simple item record

Files in this item


Item metadata

dc.contributor.authorSpracklen, Patrick
dc.contributor.authorAkgun, Ozgur
dc.contributor.authorMiguel, Ian James
dc.contributor.editorHooker, John
dc.identifier.citationSpracklen , 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 . Lecture Notes in Computer Science (including subseries Programming and Software Engineering) , vol. 11008 LNCS , Springer , Cham , pp. 362-372 .
dc.identifier.otherPURE: 255103139
dc.identifier.otherPURE UUID: 6eef5285-c1a0-471e-bba5-5a9179298de8
dc.identifier.otherScopus: 85053139902
dc.identifier.otherORCID: /0000-0001-9519-938X/work/47928988
dc.identifier.otherORCID: /0000-0002-6930-2686/work/68281433
dc.identifier.otherWOS: 000546520500024
dc.descriptionFunding: EPSRC EP/P015638/1.en
dc.description.abstractStreamlined 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.
dc.relation.ispartofPrinciples and Practice of Constraint Programmingen
dc.relation.ispartofseriesLecture Notes in Computer Science (including subseries Programming and Software Engineering)en
dc.rightsCopyright © 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
dc.subjectQA75 Electronic computers. Computer scienceen
dc.titleAutomatic generation and selection of streamlined constraint models via Monte Carlo search on a model latticeen
dc.typeConference itemen
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen

This item appears in the following Collection(s)

Show simple item record