2. Describing Global Constraints

• 2.1. Global constraint: what it is, and what it is not
  • 2.1.1. Checker view
  • 2.1.2. Feasibility view
  • 2.1.3. Filtering view
  • 2.1.4. Explanation view
  • 2.1.5. Cost violation view
  • 2.1.6. Reification view
  • 2.1.7. Counting view
  • 2.1.8. Property view
• 2.2. Describing the arguments of a global constraint
  • 2.2.1. Basic data types
  • 2.2.2. Compound data types
  • 2.2.3. Restrictions
  • 2.2.4. Declaring a global constraint
  • 2.2.5. Describing symmetries between arguments
• 2.3. Describing global constraints in terms of graph properties
  • 2.3.1. Basic ideas and illustrative example
  • 2.3.2. Ingredients used for describing global constraints
    • 2.3.2.1. Collection generators
    • 2.3.2.2. Elementary constraints attached to the arcs
    • 2.3.2.3. Graph generators
    • 2.3.2.4. Graph properties
  • 2.3.3. Graph constraint
    • 2.3.3.1. Simple graph constraint
    • 2.3.3.2. Dynamic graph constraint
• 2.4. Describing global constraints in terms of automata
  • 2.4.1. Selecting an appropriate description
  • 2.4.2. Defining an automaton
• 2.5. Reformulating global constraints as a conjunction
• 2.6. Semantic links between global constraints
  • 2.6.1. Assignment dimension added
  • 2.6.2. Assignment dimension removed
  • 2.6.3. Attached to cost variant
  • 2.6.4. Common keyword
  • 2.6.5. Comparison swapped
  • 2.6.6. Cost variant
  • 2.6.7. Generalisation
  • 2.6.8. Hard version
  • 2.6.9. Implied by
  • 2.6.10. Implies
  • 2.6.11. Implies (if swap arguments)
  • 2.6.12. Implies (items to collection)
  • 2.6.13. Negation
  • 2.6.14. Part of system of constraints
  • 2.6.15. Related
  • 2.6.16. Related to a common problem
  • 2.6.17. Root concept
  • 2.6.18. Shift of concept
  • 2.6.19. Soft variant
  • 2.6.20. Specialisation
  • 2.6.21. System of constraints
  • 2.6.22. Used in graph description
  • 2.6.23. Used in reformulation
  • 2.6.24. Uses in its reformulation