28 citations · 97 across the 20 of their papers we have counts for
22 papers
A Framework for Generating Informative Benchmark Instances
Nguyen Dang, Özgür Akgün, Joan Espasa +2
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 qual…
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…
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…
A Preliminary Case Study of Planning With Complex Transitions: Plotting
Jordi Coll, Joan Espasa, Ian Miguel +1
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 achieve…
Efficient Incremental Modelling and Solving
Gökberk Koçak, Özgür Akgün, Nguyen Dang +1
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 prob…
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…