# Constraint satisfaction problem

### From Glossary

A classical Constraint Satisfaction Problem (CSP) is defined by a finite set of variables where each variable is associated with a finite domain of integers . Furthermore, a finite set of constraints
is imposed on the variables, where
a constraint is an arbitrary relation on a subset of variables
. A solution to the CSP is a value assignment to each variable such that the value lies within the respective domain and all constraints are satisfied.

There exist different variants and sub-classes of constraint satisfaction problem: