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:

    It is in the nature of allegory, as opposed to symbolism, to beg the question of absolute reality. The allegorist avails himself of a formal correspondence between “ideas” and “things,” both of which he assumes as given; he need not inquire whether either sphere is “real” or whether, in the final analysis, reality consists in their interaction.
    Charles, Jr. Feidelson, U.S. educator, critic. Symbolism and American Literature, ch. 1, University of Chicago Press (1953)

    The definition of good prose is proper words in their proper places; of good verse, the most proper words in their proper places. The propriety is in either case relative. The words in prose ought to express the intended meaning, and no more; if they attract attention to themselves, it is, in general, a fault.
    Samuel Taylor Coleridge (1772–1834)