4.2.2. Global constraints
These constraints represent high-level modelling abstractions. Many solvers implement dedicated, efficient inference algorithms for these constraints, or provide a MiniZinc library decomposition that is better suited to the particular solving technology than the standard library decomposition.
- 4.2.2.1. All-Different and related constraints
- 4.2.2.2. Lexicographic constraints
- 4.2.2.3. Sorting constraints
- 4.2.2.4. Channeling constraints
- 4.2.2.5. Counting constraints
- 4.2.2.6. Array-related constraints
- 4.2.2.7. Set-related constraints
- 4.2.2.8. Mathematical constraints
- 4.2.2.9. Packing constraints
- 4.2.2.10. Scheduling constraints
- 4.2.2.11. Graph constraints
- 4.2.2.12. Extensional constraints (table, regular etc.)
- 4.2.2.13. Machine learning constraints
- 4.2.2.14. Deprecated constraints