24 citations · 26 across the 13 of their papers we have counts for
14 papers
Automating Reformulation of Essence Specifications via Graph Rewriting
Ian Miguel, András Z. Salamon, Christopher Stone
Formulating an effective constraint model of a parameterised problem class is crucial to the efficiency with which instances of the class can subsequently be solved. It is difficul…
Towards Exploratory Reformulation of Constraint Models
Ian Miguel, András Z. Salamon, Christopher Stone
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. Following from…
Towards a Model of Puzznic
Joan Espasa, Ian P. Gent, Ian Miguel +3
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. We focus here on levels wit…
Challenges in Modelling and Solving Plotting with PDDL
Joan Espasa, Ian Miguel, Peter Nightingale +2
We study a planning problem based on Plotting, a tile-matching puzzle video game published by Taito in 1989. The objective of this game is to remove a target number of coloured blo…
TabID: Automatic Identification and Tabulation of Subproblems in Constraint Models
Özgür Akgün, Ian P. Gent, Christopher Jefferson +5
The performance of a constraint model can often be improved by converting a subproblem into a single table constraint (referred to as tabulation). Finding subproblems to tabulate i…
Effective Guessing Has Unlikely Consequences
András Z. Salamon, Michael Wehar
A classic result of Paul, Pippenger, Szemerédi and Trotter states that DTIME(n) is strictly contained in NTIME(n). The natural question then arises: could DTIME(t(n)) be contained…
Towards Reformulating Essence Specifications for Robustness
Özgür Akgün, Alan M. Frisch, Ian P. Gent +4
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…
Using Small MUSes to Explain How to Solve Pen and Paper Puzzles
Joan Espasa, Ian P. Gent, Ruth Hoffmann +4
In this paper, we present Demystify, a general tool for creating human-interpretable step-by-step explanations of how to solve a wide range of pen and paper puzzles from a high-lev…
Exploring Instance Generation for Automated Planning
Özgür Akgün, Nguyen Dang, Joan Espasa +3
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. Constra…
Superlinear Lower Bounds Based on ETH
András Z. Salamon, Michael Wehar
We introduce techniques for proving superlinear conditional lower bounds for polynomial time problems. In particular, we show that CircuitSAT for circuits with m gates and log(m) i…
Conjure Documentation, Release 2.3.0
Özgür Akgün, András Salamon
Conjure is an automated modelling tool for Constraint Programming. In this documentation, you will find the following: A brief introduction to Conjure, installation instructions, a…
Macroscopes: models for collective decision making
Subramanian Ramamoorthy, András Z. Salamon, Rahul Santhanam
We introduce a new model of collective decision making, when a global decision needs to be made but the parties only possess partial information, and are unwilling (or unable) to f…
The tractability of CSP classes defined by forbidden patterns
David A. Cohen, Martin C. Cooper, Páidí Creed +1
The constraint satisfaction problem (CSP) is a general problem central to computer science and artificial intelligence. Although the CSP is NP-hard in general, considerable effort…
Bounds on series-parallel slowdown
András Z. Salamon, Vashti Galpin
We use activity networks (task graphs) to model parallel programs and consider series-parallel extensions of these networks. Our motivation is two-fold: the benefits of series-para…