Tailoring Solver-Independent Constraint Models: A Case Study with Essence' and Minion

نویسندگان

  • Ian P. Gent
  • Ian Miguel
  • Andrea Rendl
چکیده

In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative models of a given problem, and formulating an effective model requires a great deal of expertise. To reduce this bottleneck, the Essence language allows the specification of a problem abstractly, i.e. without making modelling decisions. This specification is refined automatically by the Conjure system to a solverindependent constraint modelling language Essence′. However, there is still significant work involved in translating an Essence′ model for use with a particular constraint solver. This paper discusses this ‘tailoring’ process with reference to the constraint solver Minion.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Constraint Model for the Settlers Planning Domain

The Settlers planning domain has proved a challenging problem for planning technology. We present a preliminary model of Settlers in the Essence’ specification language. We generate a constraint model for the CSP solver Minion using the automated modelling tool Tailor. We show this model to be competitive with state-of-the-art planning technology.

متن کامل

Minion: A Fast Scalable Constraint Solver

We present Minion, a new constraint solver. Empirical results on standard benchmarks show orders of magnitude performance gains over state-of-the-art constraint toolkits. These gains increase with problem size – Minion delivers scalable constraint solving. Minion is a general-purpose constraint solver, with an expressive input language based on the common constraint modelling device of matrix m...

متن کامل

Automatically Generating Streamlined Constraint Models with Essence and Conjure

Streamlined constraint reasoning is the addition of uninferred constraints to a constraint model to reduce the search space, while retaining at least one solution. Previously, effective streamlined models have been constructed by hand, requiring an expert to examine closely solutions to small instances of a problem class and identify regularities. We present a system that automatically generate...

متن کامل

Automated Constraint Model Enhancement during Tailoring

Constraint modelling is difficult, particularly for novices. Hence, automated methods for improving models are valuable. The context of this paper is tailoring, a process where a solver-independent constraint model is adapted to a target solver. Tailoring is augmented with automated enhancement techniques, in particular common subexpression detection and elimination, which, while powerful, can ...

متن کامل

Watched Literals for Constraint Propagation in Minion

Efficient constraint propagation is crucial to any constraint solver. We show that watched literals, already a great success in the propositional satisfiability community, can also be used to provide highly efficient implementations of constraint propagators. We describe in detail three important aspects of watched literals as we apply them to constraints, and we describe how they are implement...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007