Constraint Satisfaction Problem - Formal Definition

Formal Definition

Formally, a constraint satisfaction problem is defined as a triple, where is a set of variables, is a domain of values, and is a set of constraints. Every constraint is in turn a pair (usually represented as a matrix), where is an -tuple of variables and is an -ary relation on . An evaluation of the variables is a function from the set of variables to the domain of values, . An evaluation satisfies a constraint if . A solution is an evaluation that satisfies all constraints.

Read more about this topic:  Constraint Satisfaction Problem

Famous quotes containing the words formal and/or definition:

    The bed is now as public as the dinner table and governed by the same rules of formal confrontation.
    Angela Carter (1940–1992)

    ... we all know the wag’s definition of a philanthropist: a man whose charity increases directly as the square of the distance.
    George Eliot [Mary Ann (or Marian)