Skip to content

Research at St Andrews

Dominion: an architecture-driven approach to generating efficient constraint solvers

Research output: Chapter in Book/Report/Conference proceedingConference contribution

DOI

Open Access permissions

Open

Abstract

Constraints are used to solve combinatorial problems in a variety of industrial and academic disciplines. However most constraint solvers are designed to be general and monolithic, leading to problems with efficiency, scalability and extensibility. We propose a novel, architecture-driven constraint solver generation framework called Dominion to tackle these issues. For any given problem, Dominion generates a lean and efficient solver tailored to that problem. In this paper, we outline the Dominion approach and its implications for software architecture specification of the solver.
Close

Details

Original languageEnglish
Title of host publicationProceedings of the 9th Working IEEE/IFIP Conference on Software Architecture (WICSA)
Subtitle of host publicationBoulder, Colorado, USA 20-24 June 2011
Place of PublicationLos Alamiros, CA
PublisherIEEE Computer Society
Pages228-231
Number of pages4
ISBN (Print)978-1-61284-399-5
DOIs
StatePublished - Jun 2011
Event9th Working IEEE/IFIP Conference on Software Architecture - Boulder, United States

Conference

Conference9th Working IEEE/IFIP Conference on Software Architecture
CountryUnited States
CityBoulder
Period20/06/1124/06/11

    Research areas

  • Software architecture, Constraint solver, Generative programming

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. An Automated Approach to Generating Efficient Constraint Solvers

    Balasubramaniam, D., Jefferson, C. A., Kotthoff, L., Miguel, I. J. & Nightingale, P. 2012 2012 34th international conference on software engineering (ICSE 2012): Zurich, Switzerland 2-9 June 2012. IEEE, p. 661-671 11 p.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  2. Automatically improving constraint models in Savile Row

    Nightingale, P., Akgün, Ö., Gent, I. P., Jefferson, C., Miguel, I. & Spracklen, P. Oct 2017 In : Artificial Intelligence. 251, p. 35-61 27 p.

    Research output: Contribution to journalArticle

  3. Exploiting short supports for improved encoding of arbitrary constraints into SAT

    Akgün, Ö., Gent, I. P., Jefferson, C. A., Miguel, I. J. & Nightingale, P. W. 2016 Principles and Practice of Constraint Programming: 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings. Rueher, M. (ed.). Springer, p. 3-12 (Lecture Notes in Computer Science; vol. 9892)

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  4. Automatically Improving Constraint Models in Savile Row through Associative-Commutative Common Subexpression Elimination

    Nightingale, P., Akgun, O., Gent, I. P., Jefferson, C. & Miguel, I. Sep 2014 Principles and Practice of Constraint Programming. OSullivan, B. (ed.). Cham: Springer, p. 590-605 16 p. (Lecture Notes in Computer Science; vol. 8656)

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  5. Generating custom propagators for arbitrary constraints

    Gent, I. P., Jefferson, C., Linton, S., Miguel, I. & Nightingale, P. 1 Jun 2014 In : Artificial Intelligence. 211, 1, p. 1-33 33 p.

    Research output: Contribution to journalArticle

ID: 11754766