Show simple item record

Files in this item


Item metadata

dc.contributor.authorWetter, James
dc.contributor.authorAkgun, Ozgur
dc.contributor.authorMiguel, Ian
dc.contributor.editorPesant, Gilles
dc.identifier.citationWetter , J , Akgun , O & Miguel , I 2015 , Automatically generating streamlined constraint models with ESSENCE and CONJURE . in G Pesant (ed.) , Principles and Practice of Constraint Programming : 21st International Conference, CP 2015, Cork, Ireland, August 31 -- September 4, 2015, Proceedings . Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , vol. 9255 (LNCS) , Springer , pp. 480-496 , 21st International Conference on the Principles and Practice of Constraint Programming, CP 2015 , Cork , Ireland , 31/08/15 .
dc.identifier.otherPURE: 243751210
dc.identifier.otherPURE UUID: 9dd26cea-0c54-476f-8d04-18df430909da
dc.identifier.otherScopus: 84944543071
dc.identifier.otherORCID: /0000-0001-9519-938X/work/33210109
dc.identifier.otherWOS: 000364707100034
dc.identifier.otherORCID: /0000-0002-6930-2686/work/68281449
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, effective streamlined models have been constructed by hand, requiring an expert to examine closely solutions to small instances of a problem class and identify regularities. We present a system that automatically generates many conjectured regularities for a given Essence specification of a problem class by examining the domains of decision variables present in the problem specification. These conjectures are evaluated independently and in conjunction with one another on a set of instances from the specified class via an automated modelling tool-chain comprising of Conjure, Savile Row and Minion. Once the system has identified effective conjectures they are used to generate streamlined models that allow instances of much larger scale to be solved. Our results demonstrate good models can be identified for problems in combinatorial design, Ramsey theory, graph theory and group theory - often resulting in order of magnitude speed-ups.
dc.relation.ispartofPrinciples and Practice of Constraint Programmingen
dc.relation.ispartofseriesLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)en
dc.rightsCopyright © 2015, Springer International Publishing. This work is made available online in accordance with the publisher’s policies. This is the author created, accepted version manuscript following peer review and 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.subjectComputer Science(all)en
dc.subjectTheoretical Computer Scienceen
dc.titleAutomatically generating streamlined constraint models with ESSENCE and CONJUREen
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