TERMIUM Plus®

From: Translation Bureau

On social media

Consult the Government of Canada’s terminology data bank.

SATISFACCION RESTRICCIONES [28 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-10-14

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

The artist may specify polygons in the output view to represent a variety of layout constraints including traversable regions, entry-exit regions and obstacles. Polygons partition the output video volume into well-defined spaces that are used to accept or reject crowd tube samples as a preprocess for satisfying unary constraints before binary constraint satisfaction.

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle

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

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 3

Record 4 2020-09-14

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

In the case of quantified constraint satisfaction, the set of constraints is accompanied by a linear order of the variables and an existential or universal quantifier associated with each variable.

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle

Spanish

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

Record 5 2020-09-14

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

In order to solve a non-binary CSP [constraint satisfaction problem], one either uses an algorithm that has been generalised for non-binary constraint satisfaction or one [that] can convert the problem into an equivalent binary CSP.

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 5

Record 6 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 6

Record 7 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 7

Record 8 2019-12-19

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

Many planning problems involve unknown or imprecise information. ... Stochastic constraint satisfaction[,] which enables to handle variables that follow some probability distributions, and approaches like structural constraint satisfaction ... that enable to drop the closed-world assumption, may provide important starting points ...

Key term(s)
  • stochastical constraint satisfaction

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

Constraint satisfaction is the art of finding values for variables in a way that satisfies various constraints.

French

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

La satisfaction de contraintes [...] permet de modéliser et [de] résoudre une variété de problèmes d'optimisation combinatoire réels provenant de multiples disciplines.

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

[With] static constraint satisfaction[,] variables and constraints are predefined and are part of the search process from the very beginning ...

Key term(s)
  • statical constraint satisfaction

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

[With] dynamic constraint satisfaction[,] variables are not necessarily active from the very beginning but can be activated within the scope of the search process ...

Key term(s)
  • dynamical constraint satisfaction

French

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

Satisfaction de contraintes dynamiques. [Des chercheurs ont proposé] une approche pour résoudre les problèmes de satisfaction sous l'incertain dans des environnements dynamiques. Un environnement est dynamique si les variables, domaines ou contraintes peuvent changer pendant la recherche de solution.

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

Partial constraint satisfaction is a very desirable way of solving [constraint satisfaction problems] that are either overconstrained or too difficult to solve ...

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

[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 13

Record 14 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 14

Record 15 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 15

Record 16 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 16

Record 17 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 17

Record 18 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 18

Record 19 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 19

Record 20 2019-11-04

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

In the world of Boolean constraint satisfaction, we start with a box that contains Boolean constraints. There is only a finite number of different constraint types in the box, but of each type we have an infinite number of "copies." Now we want to combine them in order to get new constraints.

Key term(s)
  • Boolian constraint satisfaction

French

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

Spanish

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

Record 21 2019-11-04

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

In the information map, each node denotes a "concept." The relationships among ... nodes are described through tree-like charts, natural language scripts as well as constraint satisfaction rules.

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle

Spanish

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

Record 22 2019-11-04

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

The approach departs significantly from "traditional" approaches to temporal constraint satisfaction. In our approach, in fact, we use synchronization mechanisms [to deal] with events caused by a conjunction of other events.

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle

Spanish

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

Record 23 2019-11-04

English

Subject field(s)
  • Computer Programs and Programming
  • Mathematics
  • Artificial Intelligence
CONT

The only thing needed is a constraint satisfaction engine that can be configured [according to] the specifications. When given a set of input objects, the configured engine should ... be capable of producing valid solutions to the specified problem.

French

Domaine(s)
  • Programmes et programmation (Informatique)
  • Mathématiques
  • Intelligence artificielle

Spanish

Campo(s) temático(s)
  • Programas y programación (Informática)
  • Matemáticas
  • Inteligencia artificial
Save record 23

Record 24 2019-11-04

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

Fuzzy constraint satisfaction ... offers a range of constraint types and, through an idempotent aggregation operator, is computationally more tractable than other methods based on summation.

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle

Spanish

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

Record 25 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 25

Record 26 2019-11-04

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
CONT

The aim ... is to consider flexible constraint satisfaction in timetabling problems. ... Examination timetabling is subject to two types of constraints: hard and soft. Hard constraints must not be violated under any conditions, while soft constraints are desirable to satisfy, but often they have to be violated to some extent.

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle

Spanish

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

Record 27 2019-11-04

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
DEF

Constraint satisfaction networks are ... commonly used to model cognition in non-strategic settings, including perception, causal reasoning, stereotype formation, analogical mapping, legal reasoning, person construal, and preferential choice ...

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle

Spanish

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

Record 28 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 28

Copyright notice for the TERMIUM Plus® data bank

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

Features

GCtranslate (available on the Government of Canada network only)

Use this artificial intelligence prototype to translate Government of Canada content up to and including Protected B. Available to employees of selected departments and agencies only.

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: