TERMIUM Plus^®

Fiche 1,  Justifications,  Anglais

Record number: 1, Textual support number: 1 CONT

The search for more efficient algorithms, among other things, has led to algorithms that do "intelligent backtracking" and to so-called network consistency algorithms. The latter is a group of polynomial time algorithms which do not necessarily solve the constraint satisfaction problem, but which eliminate all local inconsistencies that cannot participate in a global solution. Network consistency algorithms will generally reduce the overall domain size. This makes them attractive as pre-processors for algorithms such as depth-first backtracking.  2, fiche 1, Anglais, - network%20consistency%20algorithm

Fiche 1,  Justifications,  Français

Fiche 1,  Justifications,  Espagnol

Fiche 2,  Justifications,  Anglais

Record number: 2, Textual support number: 1 CONT

[Researchers showed] that every constraint satisfaction problem(CSP) where the constraints are preserved by a semi-lattice operation can be solved in polynomial time. This is one of the basic facts for the so-called universal-algebraic approach to a systematic theory of tractability and hardness in finite domain constraint satisfaction.  1, fiche 2, Anglais, - finite%20domain%20constraint%20satisfaction

Fiche 2,  Justifications,  Français

Fiche 2,  Justifications,  Espagnol

Fiche 3,  Justifications,  Anglais

Record number: 3, Textual support number: 1 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.  2, fiche 3, Anglais, - polynomial%20constraint%20satisfaction%20problem

Fiche 3,  Justifications,  Français

Fiche 3,  Justifications,  Espagnol