Tags: constraint-programming
A constraint network is defined by a triplet , where X is a set of variables, C is a set of constraints, and D a domain for X (i.e. a mapping from variables to sets of values).
The constraint satisfaction problem (CSP) is the question of deciding whether a constraint network has a solution or not.
