An Automated Approach to Generating Efficient Constraint Solvers

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

7 Citations (Scopus)


Combinatorial problems appear in numerous settings, from timetabling to industrial design. Constraint solving aims to find solutions to such problems efficiently and automatically. Current constraint solvers are monolithic in design, accepting a broad range of problems. The cost of this convenience is a complex architecture, inhibiting efficiency, extensibility and scalability. Solver components are also tightly coupled with complex restrictions on their configuration, making automated generation of solvers difficult. We describe a novel, automated, model-driven approach to generating efficient solvers tailored to individual problems and present some results from applying the approach. The main contribution of this work is a solver generation framework called Dominion, which analyses a problem and, based on its characteristics, generates a solver using components chosen from a library. The key benefit of this approach is the ability to solve larger and more difficult problems as a result of applying finer-grained optimisations and using specialised techniques as required.
Original languageEnglish
Title of host publication2012 34th international conference on software engineering (ICSE 2012)
Subtitle of host publicationZurich, Switzerland 2-9 June 2012
Number of pages11
ISBN (Electronic)978-1-4673-1065-9
ISBN (Print)978-1-4673-1066-6
Publication statusPublished - 2012
Event34th International Conference on Software Engineering, ICSE 2012 - Zurich, Switzerland
Duration: 2 Jun 20129 Jun 2012


Conference34th International Conference on Software Engineering, ICSE 2012


Dive into the research topics of 'An Automated Approach to Generating Efficient Constraint Solvers'. Together they form a unique fingerprint.

Cite this