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:

    That anger can be expressed through words and non-destructive activities; that promises are intended to be kept; that cleanliness and good eating habits are aspects of self-esteem; that compassion is an attribute to be prized—all these lessons are ones children can learn far more readily through the living example of their parents than they ever can through formal instruction.
    Fred Rogers (20th century)

    One definition of man is “an intelligence served by organs.”
    Ralph Waldo Emerson (1803–1882)