constraint satisfaction problem
[/kənˈstreɪnt ˌsætɪsˈfækʃən ˈprɑːbləm/]
nounpl: constraint satisfaction problems
problema de satisfação de restrições
1. A computational problem in artificial intelligence and operations research where the objective is to find values for variables that satisfy a set of constraints or conditions
Solving a constraint satisfaction problem involves finding an assignment of values to variables that satisfies all given constraints.
Resolver um problema de satisfação de restrições envolve encontrar uma atribuição de valores às variáveis que satisfaça todas as restrições dadas.
2. A problem defined by a set of variables, a domain of possible values for each variable, and a set of constraints that specify which combinations of values are allowed
The sudoku puzzle is a classic constraint satisfaction problem where each cell must contain a digit from 1 to 9.
O quebra-cabeça sudoku é um clássico problema de satisfação de restrições onde cada célula deve conter um dígito de 1 a 9.
This is a technical term primarily used in computer science, artificial intelligence, and operations research fields. It is equally understood and used in both Brazil and Portugal's academic and professional communities, with the Portuguese translation being the standard equivalent. The acronym 'CSP' is commonly used in international contexts to refer to constraint satisfaction problems.
Look up more words on Fala2Me
The free English-Portuguese dictionary with real Brazilian accents, NYC slang, conjugator and more
Open Fala2Me →