St Andrews Research Repository

St Andrews University Home
View Item 
  •   St Andrews Research Repository
  • Computer Science (School of)
  • Computer Science
  • Computer Science Theses
  • View Item
  •   St Andrews Research Repository
  • Computer Science (School of)
  • Computer Science
  • Computer Science Theses
  • View Item
  •   St Andrews Research Repository
  • Computer Science (School of)
  • Computer Science
  • Computer Science Theses
  • View Item
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.

Streamlined constraint reasoning : an automated approach from high level constraint specifications

Thumbnail
View/Open
Thesis-Patrick-Spracklen-complete-version.pdf (5.591Mb)
Thesis-Patrick-Spracklen-complete-version-latex.tar.gz (14.35Mb)
Date
29/11/2022
Author
Spracklen, Patrick
Supervisor
Miguel, Ian
Akgun, Ozgur
Funder
Engineering and Physical Sciences Research Council (EPSRC)
Grant ID
EP/N509759/1
Keywords
Constraint programming
Constraint modelling
Streamlined constraint reasoning
Metadata
Show full item record
Altmetrics Handle Statistics
Altmetrics DOI Statistics
Abstract
Constraint Programming (CP) is a powerful technique for solving large-scale combinatorial (optimisation) problems. Solving a problem proceeds in two distinct phases: modelling and solving. Effective modelling has a huge impact on the performance of the solving process. Even with the advance of modern automated modelling tools, search spaces involved can be so vast that problems can still be difficult to solve. To further constrain the model a more aggressive step that can be taken is the addition of streamliner constraints, which are not guaranteed to be sound but are designed to focus effort on a highly restricted but promising portion of the search space. Previously, producing effective streamlined models was a manual, difficult and time-consuming task. This thesis presents a completely automated process to the generation, search and selection of streamliner portfolios to produce a substantial reduction in search effort across a diverse range of problems. First, we propose a method for the generation and evaluation of streamliner conjectures automatically from the type structure present in an Essence specification. Second, the possible streamliner combinations are structured into a lattice and a multi-objective search method for searching the lattice of combinations and building a portfolio of streamliner combinations is defined. Third, the problem of "Streamliner Selection" is introduced which deals with selecting from the portfolio an effective streamliner for an unseen instance. The work is evaluated by presenting two sets of experiments on a variety of problem classes. Lastly, we explore the effect of model selection in the context of streamlined specifications and discuss the process of streamlining for Constrained Optimization Problems.
DOI
https://doi.org/10.17630/sta/212
Type
Thesis, PhD Doctor of Philosophy
Collections
  • Computer Science Theses
URI
http://hdl.handle.net/10023/26251

Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

Related items

Showing items related by title, author, creator and subject.

  • Using constraints to improve generalisation and training of feedforward neural networks : constraint based decomposition and complex backpropagation 

    Draghici, Sorin (University of St Andrews, 1996) - Thesis
    Neural networks can be analysed from two points of view: training and generalisation. The training is characterised by a trade-off between the 'goodness' of the training algorithm itself (speed, reliability, guaranteed ...
  • Environmental constraints on the foraging behaviour, spatial usage and population sizes of albatrosses 

    Wakefield, Ewan D. (University of St Andrews, 2009) - Thesis
    Satellite-tracking of wide-ranging, apex marine predators, combined with remote-sensing, can be used to test ecological hypotheses and to estimate spatial abundance. I used this approach to quantify the habitat usage of ...
  • Consistency and the quantified constraint satisfaction problem 

    Nightingale, Peter (University of St Andrews, 2007-11-30) - Thesis
    Constraint satisfaction is a very well studied and fundamental artificial intelligence technique. Various forms of knowledge can be represented with constraints, and reasoning techniques from disparate fields can be ...
Advanced Search

Browse

All of RepositoryCommunities & CollectionsBy Issue DateNamesTitlesSubjectsClassificationTypeFunderThis CollectionBy Issue DateNamesTitlesSubjectsClassificationTypeFunder

My Account

Login

Open Access

To find out how you can benefit from open access to research, see our library web pages and Open Access blog. For open access help contact: openaccess@st-andrews.ac.uk.

Accessibility

Read our Accessibility statement.

How to submit research papers

The full text of research papers can be submitted to the repository via Pure, the University's research information system. For help see our guide: How to deposit in Pure.

Electronic thesis deposit

Help with deposit.

Repository help

For repository help contact: Digital-Repository@st-andrews.ac.uk.

Give Feedback

Cookie policy

This site may use cookies. Please see Terms and Conditions.

Usage statistics

COUNTER-compliant statistics on downloads from the repository are available from the IRUS-UK Service. Contact us for information.

© University of St Andrews Library

University of St Andrews is a charity registered in Scotland, No SC013532.

  • Facebook
  • Twitter