1 citations · 2 across the 11 of their papers we have counts for
11 papers · 1 filter
Faster Symmetry Breaking Constraints for Abstract Structures
Özgür Akgün, Mun See Chang, Ian P. Gent +1
In constraint programming and related paradigms, a modeller specifies their problem in a modelling language for a solver to search and return its solution(s). Using high-level mode…
Solver-Aided Expansion of Loops to Avoid Generate-and-Test
Niklas Dewally, Özgür Akgün
Constraint modelling languages like MiniZinc and Essence rely on unrolling loops (in the form of quantified expressions and comprehensions) during compilation. Standard approaches…
Breaking the Symmetries of Indistinguishable Objects
Ozgur Akgun, Mun See Chang, Ian P. Gent +1
Indistinguishable objects often occur when modelling problems in constraint programming, as well as in other related paradigms. They occur when objects can be viewed as being drawn…
Automatic Feature Learning for Essence: a Case Study on Car Sequencing
Alessio Pellegrino, Özgür Akgün, Nguyen Dang +2
Constraint modelling languages such as Essence offer a means to describe combinatorial problems at a high-level, i.e., without committing to detailed modelling decisions for a part…
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…
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…