Search Results for author:
Found 7 papers, 0 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.
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.
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.
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.
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.
The tractability of CSP classes defined by forbidden patterns
We show that this framework generalises relational properties and allows us to capture known hybrid tractable classes.
