There is no standard modelling language for constraint programming (CP) problems. Most
solvers have their own modelling language. This makes it difficult for modellers to …

Combinatorial Optimization is an important area of computer science that has many
theoretical and practical applications. In this thesis, we present important contributions to …

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 …

Essence is a new language for specifying combinatorial (decision or optimisation) problems
at a high level of abstraction. The key feature enabling this abstraction is the provision of …

Discrete constraint problems surface often in everyday life. Teachers might group students
with complex considerations and hospital administrators need to produce staff rosters …