Constraint Satisfaction Problem (CSP)

A CSP is a problem defined by a set of variables, each with a domain of possible values, and a set of constraints that restrict the combinations of values these variables can take. AI techniques are used to find assignments for the variables that satisfy all given constraints, common in scheduling or planning.