Search Results for author:
Found 15 papers, 3 papers with code
Towards Exploratory Reformulation of Constraint Models
It is well established that formulating an effective constraint model of a problem of interest is crucial to the efficiency with which it can subsequently be solved.
Challenges in Modelling and Solving Plotting with PDDL
We study a planning problem based on Plotting, a tile-matching puzzle video game published by Taito in 1989.
Towards a Model of Puzznic
We report on progress in modelling and solving Puzznic, a video game requiring the player to plan sequences of moves to clear a grid by matching blocks.
A Framework for Generating Informative Benchmark Instances
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.
Automatic Tabulation in Constraint Models
The performance of a constraint model can often be improved by converting a subproblem into a single table constraint.
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.
A Preliminary Case Study of Planning With Complex Transitions: Plotting
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.
Efficient Incremental Modelling and Solving
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.
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.
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.
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.
Towards Improving Solution Dominance with Incomparability Conditions: A case-study using Generator Itemset Mining
In this paper, in addition to specifying a dominance relation, we introduce the ability to specify an incomparability condition.
Modelling Langford's Problem: A Viewpoint for Search
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.
A Review of Literature on Parallel Constraint Solving
As multicore computing is now standard, it seems irresponsible for constraints researchers to ignore the implications of it.
Short and Long Supports for Constraint Propagation
We also introduce a variant algorithm HaggisGAC-Stable, which is adapted to avoid work on backtracking and in some cases can be faster and have significant reductions in memory use.
