Constraint logic programming extends Prolog to include concepts from constraint satisfaction. Constraint propagation techniques are methods used to modify a constraint satisfaction problem. Loop representation is required handle the spatial diffeomorphism constraint. Finite domains is one of the most successful domains of constraint programming. Solution of the spatial diffeomorphism constraint. The spatial diffeomorphism constraint has been solved. One constraint equation counts as "one" constraint. An example of a clause including a constraint is . This method is based on the use of rigidity constraint. Scope encompasses an element of "constraint". Cyclic Codes have some additional structural constraint on the codes. Further improvements can be obtained by the technique of constraint propagation. The relevant constraint is known as the "coordinate structure constraint". There are exceptions to the constraint of vowel harmony. Problem arising from the Hamiltonian constraint.