Conjure Revisited: Towards Automated Constraint Modelling
Abstract: Automating the constraint modelling process is one of the key challenges facing the con... more Abstract: Automating the constraint modelling process is one of the key challenges facing the constraints field, and one of the principal obstacles preventing widespread adoption of constraint solving. This paper focuses on the refinement-based approach to automated modelling, where a user specifies a problem in an abstract constraint specification language and it is then automatically refined into a constraint model.
Abstract In constraint solving, a critical bottleneck is the formulation of an effective constrai... more Abstract In constraint solving, a critical bottleneck is the formulation of an effective constraint model of a given problem. The CONJURE system described in this paper, a substantial step forward over prototype versions of CONJURE previously reported, makes a valuable contribution to the automation of constraint modelling by automatically producing constraint models from their specifications in the abstract constraint specification language ESSENCE.
Abstract. This paper presents a case study of automated modelling using Essence and Conjure. The ... more Abstract. This paper presents a case study of automated modelling using Essence and Conjure. The problem we study is the open stacks problem [5]. We start with a naive problem specification and show how Conjure generates a selection of constraint programming models automatically. After observing the results, we modify the original problem specification to generate better models. Finally, we further improve the generated models by introducing a new representation for partial and injective function variables.
Abstract. Modelling is one of the key challenges in Constraint Programming (CP). There are many w... more Abstract. Modelling is one of the key challenges in Constraint Programming (CP). There are many ways in which to model a given problem. The model chosen has a substantial effect on the solving efficiency. It is difficult to know what the best model is. To overcome this problem we take a portfolio approach: Given a high level specification of a combinatorial problem, we employ non-deterministic rewrite techniques to obtain a portfolio of constraint models.
Uploads
Papers by Özgür Akgün