When solving a combinatorial problem using Constraint Programming (CP) or Satisfiability
(SAT), modelling and formulation are vital and difficult tasks. Even an expert human may …

Many symmetry breaking techniques assume that the symmetries of a CSP are given as
input in addition to the CSP itself. We present a method that can be used to detect all the …

When solving a combinatorial problem, the formulation or model of the problem is critical to
the efficiency of the solver. Automating the modelling process has long been of interest …

A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while
one formulation of a CSP may enable a solver to solve it quickly, a different formulation may …

When solving a problem using constraint programming, constraint modelling is widely
acknowledged as an important and difficult task. Even a constraint modelling expert may …

Automatic symmetry detection has received a significant amount of interest, which has
resulted in a large number of proposed methods. This paper reports on our experiences …

Constraint Programming (CP) is a powerful technique for solving large-scale combinatorial
problems. Solving a problem proceeds in two distinct phases: modelling and solving …

In this demonstration, we present an engine leveraging graph transformations for the
automated reformulation of constraint specifications of combinatorial search problems …

Constraint programs with one or more matrices of decision variables are commonly and
naturally used to model real-world problems. We call these matrix models and claim that …

We present a method that, given a constraint model, suggests global constraints to replace
parts of it. This helps non-expert users to write higher-level models that are easier to reason …