This report presents a catalogue of global constraints where

each constraint is explicitly described in terms of graph properties and/or automata and/or first order logical formulae with arithmetic. When available, it also presents some typical usage as well as some pointers to existing

filtering algorithms

Beldiceanu, Nicolas

Carlsson, Mats

Rampon, Jean-Xavier

Digitala Vetenskapliga Arkivet - Academic Archive On-line

Swedish Institute of Computer Science Publications Database

English

1336 packing almost squares,

216 magic hexagon, 238, 415, 956 magic series, 240, 939 magic square,

270, 692, 708, 712, 822, 910, 1058, 1244, 1414 randomized filtering algorithm, 203 RANGE, 71, 421, 1454 range, 269, 1452 range, 103, 1460 range consistency, 158 range ctr,

406, 548, 844, 1706 joker value,

548, 844, 1706 gcc, 936, 942 gcc low up, 220, 942 gcc low up no loop, 220, 946 gcc no loop, 950 gccc, 954 gcd,

922, 1168, 1172, 1648 Zanarini A., 103, 410 zebra puzzle, 318, 415, 869, 1081 zero-duration task,

bin packing capa,

Channel Routing with Constraint Logic Programming and Delay.

same and gcc, 1472 same and global cardinality,

unary constraint, 313, 1004, 1008, 1016, 1328, 1658 unavailability period, 282 undirected graph, 313, 1449, 1684 used in graph description, 94 used in reformulation, 94 used by,

value partitioning constraint,

Global Constraint Catalog, 2nd Edition