Examples of using Constraint satisfaction in English and their translations into Portuguese
{-}
- 
                        Colloquial
                    
 - 
                        Official
                    
 - 
                        Medicine
                    
 - 
                        Financial
                    
 - 
                        Ecclesiastic
                    
 - 
                        Ecclesiastic
                    
 - 
                        Computer
                    
 - 
                        Official/political
                    
 
The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction.
Given a constraint satisfaction problem with only binary constraints, 
Also different is the way in which they are used: for a constraint satisfaction problem, finding a satisfying assignment is the main problem;
PCP and hardness of approximation==An alternative formulation of the PCP theorem states that the maximum fraction of satisfiable constraints  of a constraint satisfaction problem is NP-hard to approximate within some constant factor.
As a result, if a constraint satisfaction problem has the table on the left as its set of solutions,
Algorithms for searching virtual spaces are used in the constraint satisfaction problem, where the goal is to find a set of value assignments to certain variables that will satisfy specific mathematical equations and inequations/ equalities.
Satisfiability of the constraint satisfaction problem corresponds to finding a value for every variable such that replacing a value in a signature makes it a tuple in the relation of the constraint. .
Constraint satisfaction problems composed of binary constraints  only can be viewed as graphs,
As a result, the constraint satisfaction problem can be used to set a constraint  whose relation is the table on the right,
A link between constraint satisfaction and database theory has been provided in the form of a correspondence between the problem of constraint  satisfiability to the problem of checking whether there exists a homomorphism between two relational structures.
can be roughly thought of as certain forms of the constraint satisfaction problem.
can be dealt with as non-arithmetic constraints  see Pattern-Based Constraint Satisfaction and Logic Puzzles.
The solutions of a constraint satisfaction problem are the result of an inner join of the tables representing its constraints; 
Examples of simple problems that can be modeled as a constraint satisfaction problem include: Eight queens puzzle Map coloring problem Sudoku,
where Φ is a constraint satisfaction problem over Boolean alphabet with at most K variables per constraint. .
an open source project for constraint satisfaction accessible from C,
Variants of CSPs==The classic model of Constraint Satisfaction Problem defines a model of static, inflexible constraints.
Research has also established relationship of the constraint satisfaction problem with problems in other areas such as finite model theory.
inequalities are often not considered within the definition of a"constraint satisfaction problem", which is limited to finite domains.
Research has also established a relationship between the constraint satisfaction problem and problems in other areas such as finite model theory and databases.