Towards Portfolios of Streamlined Constraint Models: A Case Study with the Balanced Academic Curriculum Problem

09/21/2020
by   Patrick Spracklen, et al.
0

Augmenting a base constraint model with additional constraints can strengthen the inferences made by a solver and therefore reduce search effort. We focus on the automatic addition of streamliner constraints, derived from the types present in an abstract Essence specification of a problem class of interest, which trade completeness for potentially very significant reduction in search. The refinement of streamlined Essence specifications into constraint models suitable for input to constraint solvers gives rise to a large number of modelling choices in addition to those required for the base Essence specification. Previous automated streamlining approaches have been limited in evaluating only a single default model for each streamlined specification. In this paper we explore the effect of model selection in the context of streamlined specifications. We propose a new best-first search method that generates a portfolio of Pareto Optimal streamliner-model combinations by evaluating for each streamliner a portfolio of models to search and explore the variability in performance and find the optimal model. Various forms of racing are utilised to constrain the computational cost of training.

READ FULL TEXT
research
09/08/2011

Conjure Revisited: Towards Automated Constraint Modelling

Automating the constraint modelling process is one of the key challenges...
research
11/01/2021

Towards Reformulating Essence Specifications for Robustness

The Essence language allows a user to specify a constraint problem at a ...
research
09/07/2021

Sensitive Samples Revisited: Detecting Neural Network Attacks Using Constraint Solvers

Neural Networks are used today in numerous security- and safety-relevant...
research
08/29/2018

Modelling Langford's Problem: A Viewpoint for Search

The performance of enumerating all solutions to an instance of Langford'...
research
08/25/2010

Distributed solving through model splitting

Constraint problems can be trivially solved in parallel by exploring dif...
research
11/28/2016

The BIN_COUNTS Constraint: Filtering and Applications

We introduce the BIN_COUNTS constraint, which deals with the problem of ...
research
09/23/2020

Symbolic Execution + Model Counting + Entropy Maximization = Automatic Search Synthesis

We present a method of automatically synthesizing steps to solve search ...

Please sign up or login with your details

Forgot password? Click here to reset