| Constraint Satisfaction Problems: In computer science, a constraint satisfaction problem (CSP) is a problem where we have a set of variables and a set of constraints that specify which values the variables can take. The goal is to find an assignment of values to the variables that satisfies all the constraints._____________Annotation: The above characterizations of concepts are neither definitions nor exhausting presentations of problems related to them. Instead, they are intended to give a short introduction to the contributions below. – Lexicon of Arguments. |
