TERMIUM Plus®

The Government of Canada’s terminology and linguistic data bank.

PROBLEMA SATISFACCION RESTRICCIONES [13 records]

Record 1 2020-10-14

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

For a BCSP, the constraint is defined as the binary relation between any two variables in the variable set ...

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle
CONT

[...] les algorithmes classiques, définis dans le contexte des problèmes de satisfaction de contraintes binaires, ne se généralisent pas aisément au contexte des problèmes non binaires.

Spanish

Campo(s) temático(s)
  • Matemáticas
  • Inteligencia artificial
Save record 1

Record 2 2020-09-14

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

In [a] quantified CSP (QCSP), variables are existentially or universally quantified.

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle
CONT

[Dans] les problèmes de satisfaction de contraintes quantifiées[,] chaque variable est quantifiée soit existentiellement, soit universellement.

Spanish

Campo(s) temático(s)
  • Matemáticas
  • Inteligencia artificial
Save record 2

Record 3 2020-09-14

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

We introduce ... polynomial constraint satisfaction problems, or PCSP. Where the usual [constraint satisfaction problems] from computer science and optimization have real-valued score functions, and partition functions from physics have monomials, [a] PCSP has scores that are arbitrary multivariate formal polynomials, or indeed take values in an arbitrary ring.

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle

Spanish

Campo(s) temático(s)
  • Matemáticas
  • Inteligencia artificial
Save record 3

Record 4 2020-09-14

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

A non-binary constraint satisfaction problem (CSP) can be solved by converting the problem into an equivalent binary one and applying well-established binary CSP techniques.

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle

Spanish

Campo(s) temático(s)
  • Matemáticas
  • Inteligencia artificial
CONT

Hoy en día, muchos problemas reales pueden ser modelados como problemas de satisfacción de restricciones no binarias.

Save record 4

Record 5 2019-11-04

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

[Researchers] introduced the concept of partial constraint satisfaction problems[,] also called PCSPs[,] to capture the idea that certain constraints can be relaxed, or violated in a solution.

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle

Spanish

Campo(s) temático(s)
  • Matemáticas
  • Inteligencia artificial
Save record 5

Record 6 2019-11-04

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

Fuzzy constraint satisfaction problems ... are used ... when the constraints are soft. Instead of demanding a perfect solution, it [demands] an optimal solution that best satisfies the given constraints.

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle

Spanish

Campo(s) temático(s)
  • Matemáticas
  • Inteligencia artificial
Save record 6

Record 7 2019-11-04

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

A constraint satisfaction problem (CSP) consists of a set of variables, a domain for each variable, and a set of constraints. The aim is to choose a value for each variable so that the resulting possible world satisfies the constraints ...

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle
CONT

Dans un problème de satisfaction de contraintes, on cherche à assigner aux variables des valeurs de telle sorte que toutes les contraintes fournies en entrée soient satisfaites.

Spanish

Campo(s) temático(s)
  • Matemáticas
  • Inteligencia artificial
CONT

Un problema de satisfacción de restricciones viene definido por un conjunto finito de variables, un conjunto finito de dominios asociados a cada variable y un conjunto finito de restricciones que definen una serie de propiedades que deben verificar los valores asignados a las variables.

Save record 7

Record 8 2019-11-04

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

... it has become clear that the original formulation of a static constraint satisfaction problem (CSP) with hard, imperative constraints is insufficient to model many real problems.

Key term(s)
  • statical constraint satisfaction problem
  • statical CSP

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle

Spanish

Campo(s) temático(s)
  • Matemáticas
  • Inteligencia artificial
Save record 8

Record 9 2019-11-04

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

A temporal constraint satisfaction problem (TCSP) is a particular class of [constraint satisfaction problems] where variables represent ... time points, time intervals or durations ... and constraints represent sets of allowed temporal relations between [the variables].

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle

Spanish

Campo(s) temático(s)
  • Matemáticas
  • Inteligencia artificial
Save record 9

Record 10 2019-11-04

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

Flexible CSP. A solution to a flexible constraint satisfaction problem is assessed by a vector of n numbers that represent the degree to which each of the n constraints are satisfied; the degree of satisfaction is usually modelled as a number between 0 and 1.

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle

Spanish

Campo(s) temático(s)
  • Matemáticas
  • Inteligencia artificial
Save record 10

Record 11 2019-11-04

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

[In] a typical Boolean constraint satisfaction problem (BCSP), ... each Boolean expression is seen as a Boolean constraint.

Key term(s)
  • Boolian constraint satisfaction problem
  • Boolian CSP

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle
Key term(s)
  • problème de satisfaction de contraintes booléiennes

Spanish

Campo(s) temático(s)
  • Matemáticas
  • Inteligencia artificial
Save record 11

Record 12 2019-11-04

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

A stochastic constraint satisfaction problem is a [constraint satisfaction problem] with some stochastic variables.

Key term(s)
  • stochastical constraint satisfaction problem
  • stochastical CSP

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle

Spanish

Campo(s) temático(s)
  • Matemáticas
  • Inteligencia artificial
Save record 12

Record 13 2019-11-04

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

An important variant of the constraint satisfaction problem is the dynamic constraint satisfaction problem, or DCSP. In this form of the problem, an initial [constraint satisfaction problem] is subject to a sequence of alterations to its basic elements (typically addition or deletion of values or constraints).

Key term(s)
  • dynamical constraint satisfaction problem
  • dynamical CSP

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle

Spanish

Campo(s) temático(s)
  • Matemáticas
  • Inteligencia artificial
Save record 13

Copyright notice for the TERMIUM Plus® data bank

© Public Services and Procurement Canada, 2025
TERMIUM Plus®, the Government of Canada's terminology and linguistic data bank
A product of the Translation Bureau

Features

Language Portal of Canada

Access a collection of Canadian resources on all aspects of English and French, including quizzes.

Writing tools

The Language Portal’s writing tools have a new look! Easy to consult, they give you access to a wealth of information that will help you write better in English and French.

Glossaries and vocabularies

Access Translation Bureau glossaries and vocabularies.

Date Modified: