TERMIUM Plus®

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

FINITE DOMAIN CONSTRAINT SATISFACTION [1 record]

Filter results by subject field Alphabetical list of terms

Filter results by subject field

Alphabetical list of terms

Record 1 2020-10-14

English

Subject field(s)
  • Mathematics
  • Artificial Intelligence
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.

French

Domaine(s)
  • Mathématiques
  • Intelligence artificielle

Spanish

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

Copyright notice for the TERMIUM Plus® data bank

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

Display options

Change the order of display of the official languages of Canada
Option to display the non-official languages (Spanish or Portuguese)
Display definitions, contexts, etc., on records

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: