Constraint programming is a programming paradigm in which a problem is specified through variables, domains, and constraints that acceptable solutions must satisfy. It is widely used for scheduling, planning, resource allocation, and combinatorial search.
A programming paradigm wherein relations between variables are stated in the form of constraints. Constraints differ from the common primitives of imperative programming languages in that they do not specify a step or sequence of steps to execute, but rather the properties of a solution to be found.