Next: Enumeration Predicates, Previous: CLPFD Interface, Up: lib-clpfd [Contents][Index]
This section describes constraints that can be used with this solver, organized into classes. Unless documented otherwise, constraints are not reifiable and do not guarantee any particular level of consistency.
| • 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 | |
| • Sequence Constraints | Sequence Constraints | |
| • User-Defined Constraints | User-Defined Constraints |