This section describes constraints that can be used with this solver, organized into classes. Unless documented otherwise, constraints are not reifiable and don’t guarantee any particular level of consistency. Whenever a domain variable is required in the argument of a constraint, a small integer can be given instead.
• Arithmetic Constraints: | Arithmetic Constraints | |
• Membership Constraints: | Membership Constraints | |
• Propositional Constraints: | Propositional Constraints | |
• Arithmetic-Logical Constraints: | Arithmetic-Logical Constraints | |
• Extensional Constraints: | Extensional Constraints | |
• Graph Constraints: | Graph Constraints | |
• Scheduling Constraints: | Scheduling Constraints | |
• Placement Constraints: | Placement Constraints | |
• Automata Constraints: | Automata Constraints | |
• User-Defined Constraints: | User-Defined Constraints |