# 1. Getting started

The main entries you may consult if you want to have a first look to the catalogue are:

To get an idea of the multiple facets of global constraints look at Section 2.1.

To get an idea of how global

**constraint arguments**are described look at Section 2.2.To

**search in the catalogue**look at Section 3.3.To

**search a constraint from a keyword**look at Section 3.7.To get an idea

**how keywords are structured**look at Section 3.6.To know

**available semantic links between constraints**look at Section 2.6.To get through the

**core global constraints**look at the keyword core. Most core global constraints have a small set of exercises with solutions for checking that different facets of a core constraint are well understood. These exercises are located in the**Quiz**slot at the end of a constraint catalog entry, e.g. for $\mathrm{\U0001d68a\U0001d695\U0001d695\U0001d68d\U0001d692\U0001d68f\U0001d68f\U0001d68e\U0001d69b\U0001d68e\U0001d697\U0001d69d}$ see page 5.12.To see how

**constraints symmetries**are described look at Section 2.2.5.To get an idea of

**general filtering techniques**look at the meta-keyword filtering and more specifically to the entries Berge-acyclic constraint network, constructive disjunction, flow and sweep. To get the notion of**consistency**achieved by a filtering algorithm look at the keywords arc-consistency and bound-consistency.To get an idea of

**modelling techniques**and of**modelling exercises**look at the meta-keywords modelling and modelling exercises.To get and idea of

**reformulations**of global constraints look at Section 2.5.To get an idea of general ways to

**explicitly represent the meaning of global constraints**look at (a) Section 2.3 for the*graph property based description*, (b) Section 2.4 for the*automaton based description*, (c) the reference [CarlssonBeldiceanuMartin08]) for the*logical based description*(e.g., see the**Logic**slot of $\mathrm{\U0001d696\U0001d68e\U0001d68e\U0001d69d}\_\mathrm{\U0001d69c\U0001d68b\U0001d698\U0001d6a1\U0001d68e\U0001d69c}$).To get an idea of the

**meta-data**used for describing various aspects of a constraint look at Section 4.5.1 for*the facts*and Section 4.5.2 for the*XML schema*.To get the

**correspondence of global constraints**of the catalogue**with concrete constraint systems or modelling languages**, such as**Choco**,**Gecode**,**JaCoP**,**MiniZinc**, or**SICStus**look at Appendix Systems.

Some material of the global constraint catalogue may be used for teaching global constraints, namely:

Section 2.1 to get a first idea about global constraints,

The definition and use of the core global constraints starting with $\mathrm{\U0001d68a\U0001d695\U0001d695\U0001d68d\U0001d692\U0001d68f\U0001d68f\U0001d68e\U0001d69b\U0001d68e\U0001d697\U0001d69d}$ and $\mathrm{\U0001d68e\U0001d695\U0001d68e\U0001d696\U0001d68e\U0001d697\U0001d69d}$, continuing with $\mathrm{\U0001d68c\U0001d69e\U0001d696\U0001d69e\U0001d695\U0001d68a\U0001d69d\U0001d692\U0001d69f\U0001d68e}$, $\mathrm{\U0001d68d\U0001d692\U0001d68f\U0001d68f\U0001d697}$ and $\mathrm{\U0001d68c\U0001d6a2\U0001d68c\U0001d695\U0001d68e}$, and finishing with $\mathrm{\U0001d690\U0001d695\U0001d698\U0001d68b\U0001d68a\U0001d695}\_\mathrm{\U0001d68c\U0001d68a\U0001d69b\U0001d68d\U0001d692\U0001d697\U0001d68a\U0001d695\U0001d692\U0001d69d\U0001d6a2}$, $\mathrm{\U0001d697\U0001d69f\U0001d68a\U0001d695\U0001d69e\U0001d68e}$, and $\mathrm{\U0001d69c\U0001d698\U0001d69b\U0001d69d}$. Exercises for these constraints are located in the

**Quiz**slot at the end of a constraint catalog entry. Exercises involving more than one constraint are available from the keyword Modelling exercises. All exercises are listed at the end of the catalogue page.

Moreover additional on-line material that could also be used for teaching is:

An online version constraint course focussing on core global constraints is available where exercises can be done interactively. It will be updated before April 2014.

The constraint seeker allows users searching for global constraints, given positive and negative, fully instantiated examples without knowing neither the names of the constraints nor the way they arguments are organised (see the on-line help for using that tool).