Global constraints as graph properties on structured network of elementary constraints of the same type

• This report introduces a classification scheme for the global constraints. This classification is based on four basic ingredients from which one can generate almost all existing global constraints and come up with new interesting constraints. Global constraints are defined in a very concise way, in term of graph properties that have to hold, where the graph is a structured network of same elementary constraints. Since this classification is based on the internal structure of the global constraints it is also a strong hint for the pruning algorithms of the global constraints.

Ämnesord

NATURVETENSKAP  -- Data- och informationsvetenskap (hsv//swe)

NATURAL SCIENCES  -- Computer and Information Sciences (hsv//eng)

Nyckelord

Constraint

Finite domain

Global constraint

Classification

Resource constraint scheduling

Graph partitioning

Timetabling

Publikations- och innehållstyp

vet (ämneskategori)

rap (ämneskategori)