Alert button
Picture for Ian Miguel

Ian Miguel

Alert button

A Framework for Generating Informative Benchmark Instances

May 29, 2022
Nguyen Dang, Özgür Akgün, Joan Espasa, Ian Miguel, Peter Nightingale

Figure 1 for A Framework for Generating Informative Benchmark Instances
Figure 2 for A Framework for Generating Informative Benchmark Instances
Figure 3 for A Framework for Generating Informative Benchmark Instances
Figure 4 for A Framework for Generating Informative Benchmark Instances

Benchmarking is an important tool for assessing the relative performance of alternative solving approaches. However, the utility of benchmarking is limited by the quantity and quality of the available problem instances. Modern constraint programming languages typically allow the specification of a class-level model that is parameterised over instance data. This separation presents an opportunity for automated approaches to generate instance data that define instances that are graded (solvable at a certain difficulty level for a solver) or can discriminate between two solving approaches. In this paper, we introduce a framework that combines these two properties to generate a large number of benchmark instances, purposely generated for effective and informative benchmarking. We use five problems that were used in the MiniZinc competition to demonstrate the usage of our framework. In addition to producing a ranking among solvers, our framework gives a broader understanding of the behaviour of each solver for the whole instance space; for example by finding subsets of instances where the solver performance significantly varies from its average performance.

* 15 pages 
Viaarxiv icon

Automatic Tabulation in Constraint Models

Feb 26, 2022
Özgür Akgün, Ian P. Gent, Christopher Jefferson, Zeynep Kiziltan, Ian Miguel, Peter Nightingale, András Z. Salamon, Felix Ulrich-Oltean

Figure 1 for Automatic Tabulation in Constraint Models
Figure 2 for Automatic Tabulation in Constraint Models
Figure 3 for Automatic Tabulation in Constraint Models
Figure 4 for Automatic Tabulation in Constraint Models

The performance of a constraint model can often be improved by converting a subproblem into a single table constraint. In this paper we study heuristics for identifying promising candidate subproblems, where converting the candidate into a table constraint is likely to improve solver performance. We propose a small set of heuristics to identify common cases, such as expressions that will propagate weakly. The process of discovering promising subproblems and tabulating them is entirely automated in the constraint modelling tool Savile Row. Caches are implemented to avoid tabulating equivalent subproblems many times. We give a simple algorithm to generate table constraints directly from a constraint expression in \savilerow. We demonstrate good performance on the benchmark problems used in earlier work on tabulation, and also for several new problem classes. In some cases, the entirely automated process leads to orders of magnitude improvements in solver performance.

Viaarxiv icon

Towards Reformulating Essence Specifications for Robustness

Nov 01, 2021
Özgür Akgün, Alan M. Frisch, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon

Figure 1 for Towards Reformulating Essence Specifications for Robustness
Figure 2 for Towards Reformulating Essence Specifications for Robustness
Figure 3 for Towards Reformulating Essence Specifications for Robustness
Figure 4 for Towards Reformulating Essence Specifications for Robustness

The Essence language allows a user to specify a constraint problem at a level of abstraction above that at which constraint modelling decisions are made. Essence specifications are refined into constraint models using the Conjure automated modelling tool, which employs a suite of refinement rules. However, Essence is a rich language in which there are many equivalent ways to specify a given problem. A user may therefore omit the use of domain attributes or abstract types, resulting in fewer refinement rules being applicable and therefore a reduced set of output models from which to select. This paper addresses the problem of recovering this information automatically to increase the robustness of the quality of the output constraint models in the face of variation in the input Essence specification. We present reformulation rules that can change the type of a decision variable or add attributes that shrink its domain. We demonstrate the efficacy of this approach in terms of the quantity and quality of models Conjure can produce from the transformed specification compared with the original.

* 12 pages, 6 figures, presented at ModRef 2021 
Viaarxiv icon

A Preliminary Case Study of Planning With Complex Transitions: Plotting

Oct 27, 2021
Jordi Coll, Joan Espasa, Ian Miguel, Mateu Villaret

Figure 1 for A Preliminary Case Study of Planning With Complex Transitions: Plotting
Figure 2 for A Preliminary Case Study of Planning With Complex Transitions: Plotting
Figure 3 for A Preliminary Case Study of Planning With Complex Transitions: Plotting

Plotting is a tile-matching puzzle video game published by Taito in 1989. Its objective is to reduce a given grid of coloured blocks down to a goal number or fewer. This is achieved by the avatar character repeatedly shooting the block it holds into the grid. Plotting is an example of a planning problem: given a model of the environment, a planning problem asks us to find a sequence of actions that can lead from an initial state of the environment to a given goal state while respecting some constraints. The key difficulty in modelling Plotting is in capturing the way the puzzle state changes after each shot. A single shot can affect multiple tiles directly, and the grid is affected by gravity so numerous other tiles can be affected indirectly. We present and evaluate a constraint model of the Plotting problem that captures this complexity. We also discuss the difficulties and inefficiencies of modelling Plotting in PDDL, the standard language used for input to specialised AI planners. We conclude by arguing that AI planning could benefit from a richer modelling language.

* Presented in the 20th workshop on Constraint Modelling and Reformulation (October 25th, 2021). The workshop is integrated in the The 27th International Conference on Principles and Practice of Constraint Programming, CP2021 
Viaarxiv icon

Efficient Incremental Modelling and Solving

Sep 23, 2020
Gökberk Koçak, Özgür Akgün, Nguyen Dang, Ian Miguel

Figure 1 for Efficient Incremental Modelling and Solving
Figure 2 for Efficient Incremental Modelling and Solving
Figure 3 for Efficient Incremental Modelling and Solving
Figure 4 for Efficient Incremental Modelling and Solving

In various scenarios, a single phase of modelling and solving is either not sufficient or not feasible to solve the problem at hand. A standard approach to solving AI planning problems, for example, is to incrementally extend the planning horizon and solve the problem of trying to find a plan of a particular length. Indeed, any optimization problem can be solved as a sequence of decision problems in which the objective value is incrementally updated. Another example is constraint dominance programming (CDP), in which search is organized into a sequence of levels. The contribution of this work is to enable a native interaction between SAT solvers and the automated modelling system Savile Row to support efficient incremental modelling and solving. This allows adding new decision variables, posting new constraints and removing existing constraints (via assumptions) between incremental steps. Two additional benefits of the native coupling of modelling and solving are the ability to retain learned information between SAT solver calls and to enable SAT assumptions, further improving flexibility and efficiency. Experiments on one optimisation problem and five pattern mining tasks demonstrate that the native interaction between the modelling system and SAT solver consistently improves performance significantly.

* ModRef 2020 - The 19th workshop on Constraint Modelling and Reformulation  
Viaarxiv icon

Exploring Instance Generation for Automated Planning

Sep 21, 2020
Özgür Akgün, Nguyen Dang, Joan Espasa, Ian Miguel, András Z. Salamon, Christopher Stone

Figure 1 for Exploring Instance Generation for Automated Planning
Figure 2 for Exploring Instance Generation for Automated Planning
Figure 3 for Exploring Instance Generation for Automated Planning
Figure 4 for Exploring Instance Generation for Automated Planning

Many of the core disciplines of artificial intelligence have sets of standard benchmark problems well known and widely used by the community when developing new algorithms. Constraint programming and automated planning are examples of these areas, where the behaviour of a new algorithm is measured by how it performs on these instances. Typically the efficiency of each solving method varies not only between problems, but also between instances of the same problem. Therefore, having a diverse set of instances is crucial to be able to effectively evaluate a new solving method. Current methods for automatic generation of instances for Constraint Programming problems start with a declarative model and search for instances with some desired attributes, such as hardness or size. We first explore the difficulties of adapting this approach to generate instances starting from problem specifications written in PDDL, the de-facto standard language of the automated planning community. We then propose a new approach where the whole planning problem description is modelled using Essence, an abstract modelling language that allows expressing high-level structures without committing to a particular low level representation in PDDL.

* ModRef 2020 - The 19th workshop on Constraint Modelling and Reformulation  
Viaarxiv icon

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

Sep 21, 2020
Patrick Spracklen, Nguyen Dang, Özgür Akgün, Ian Miguel

Figure 1 for Towards Portfolios of Streamlined Constraint Models: A Case Study with the Balanced Academic Curriculum Problem
Figure 2 for Towards Portfolios of Streamlined Constraint Models: A Case Study with the Balanced Academic Curriculum Problem
Figure 3 for Towards Portfolios of Streamlined Constraint Models: A Case Study with the Balanced Academic Curriculum Problem
Figure 4 for Towards Portfolios of Streamlined Constraint Models: A Case Study with the Balanced Academic Curriculum Problem

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.

* ModRef 2020 - The 19th workshop on Constraint Modelling and Reformulation  
Viaarxiv icon

A Commentary on "Breaking Row and Column Symmetries in Matrix Models"

Oct 03, 2019
Alan M. Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Toby Walsh

Figure 1 for A Commentary on "Breaking Row and Column Symmetries in Matrix Models"

The CP 2002 paper entitled "Breaking Row and Column Symmetries in Matrix Models" by Flener et al. (https://link.springer.com/chapter/10.1007%2F3-540-46135-3_31) describes some of the first work for identifying and analyzing row and column symmetry in matrix models and for efficiently and effectively dealing with such symmetry using static symmetry-breaking ordering constraints. This commentary provides a retrospective on that work and highlights some of the subsequent work on the topic.

* Appeared in the virtual volume celebrating the first 25 years of the CP conference (https://freuder.wordpress.com/cp-anniversary-project/) 
Viaarxiv icon

Towards Improving Solution Dominance with Incomparability Conditions: A case-study using Generator Itemset Mining

Oct 01, 2019
Gökberk Koçak, Özgür Akgün, Tias Guns, Ian Miguel

Figure 1 for Towards Improving Solution Dominance with Incomparability Conditions: A case-study using Generator Itemset Mining
Figure 2 for Towards Improving Solution Dominance with Incomparability Conditions: A case-study using Generator Itemset Mining
Figure 3 for Towards Improving Solution Dominance with Incomparability Conditions: A case-study using Generator Itemset Mining
Figure 4 for Towards Improving Solution Dominance with Incomparability Conditions: A case-study using Generator Itemset Mining

Finding interesting patterns is a challenging task in data mining. Constraint based mining is a well-known approach to this, and one for which constraint programming has been shown to be a well-suited and generic framework. Dominance programming has been proposed as an extension that can capture an even wider class of constraint-based mining problems, by allowing to compare relations between patterns. In this paper, in addition to specifying a dominance relation, we introduce the ability to specify an incomparability condition. Using these two concepts we devise a generic framework that can do a batch-wise search that avoids checking incomparable solutions. We extend the ESSENCE language and underlying modelling pipeline to support this. We use generator itemset mining problem as a test case and give a declarative specification for that. We also present preliminary experimental results on this specific problem class with a CP solver backend to show that using the incomparability condition during search can improve the efficiency of dominance programming and reduces the need for post-processing to filter dominated solutions.

Viaarxiv icon

Modelling Langford's Problem: A Viewpoint for Search

Aug 29, 2018
Özgür Akgün, Ian Miguel

Figure 1 for Modelling Langford's Problem: A Viewpoint for Search
Figure 2 for Modelling Langford's Problem: A Viewpoint for Search
Figure 3 for Modelling Langford's Problem: A Viewpoint for Search
Figure 4 for Modelling Langford's Problem: A Viewpoint for Search

The performance of enumerating all solutions to an instance of Langford's Problem is sensitive to the model and the search strategy. In this paper we compare the performance of a large variety of models, all derived from two base viewpoints. We empirically show that a channelled model with a static branching order on one of the viewpoints offers the best performance out of all the options we consider. Surprisingly, one of the base models proves very effective for propagation, while the other provides an effective means of stating a static search order.

* ModRef 2018 - The 17th workshop on Constraint Modelling and Reformulation  
Viaarxiv icon