2. Describing Global Constraints

• 2.1. Describing the arguments of a global constraint
  • 2.1.1. Basic data types
  • 2.1.2. Compound data types
  • 2.1.3. Restrictions
  • 2.1.4. Declaring a global constraint
  • 2.1.5. Describing symmetries between arguments
• 2.2. Describing global constraints in terms of graph properties
  • 2.2.1. Basic ideas and illustrative example
  • 2.2.2. Ingredients used for describing global constraints
    • 2.2.2.1. Collection generators
    • 2.2.2.2. Elementary constraints attached to the arcs
    • 2.2.2.3. Graph generators
    • 2.2.2.4. Graph properties
  • 2.2.3. Graph constraint
    • 2.2.3.1. Simple graph constraint
    • 2.2.3.2. Dynamic graph constraint
• 2.3. Describing global constraints in terms of automata
  • 2.3.1. Selecting an appropriate description
  • 2.3.2. Defining an automaton
• 2.4. Reformulating global constraints as a conjunction
• 2.5. Semantic links between global constraints
  • 2.5.1. Assignment dimension added
  • 2.5.2. Assignment dimension removed
  • 2.5.3. Attached to cost variant
  • 2.5.4. Common keyword
  • 2.5.5. Comparison swapped
  • 2.5.6. Cost variant
  • 2.5.7. Generalisation
  • 2.5.8. Hard version
  • 2.5.9. Implied by
  • 2.5.10. Implies
  • 2.5.11. Implies if swap arguments
  • 2.5.12. Negation
  • 2.5.13. Part of system of constraints
  • 2.5.14. Related
  • 2.5.15. Related to a common problem
  • 2.5.16. Root concept
  • 2.5.17. Shift of concept
  • 2.5.18. Soft variant
  • 2.5.19. Specialisation
  • 2.5.20. System of constraints
  • 2.5.21. Used in graph description
  • 2.5.22. Used in reformulation
  • 2.5.23. Uses in its reformulation