TERMIUM Plus®

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

BOOLEAN SATISFIABILITY PROBLEM [1 record]

Filter results by subject field Alphabetical list of terms

Filter results by subject field

Alphabetical list of terms

Record 1 2023-10-17

English

Subject field(s)
  • Computer Mathematics
  • Artificial Intelligence
CONT

The Boolean satisfiability problem, also known as SAT, is a problem in AI [artificial intelligence] that is used to determine whether or not a given Boolean formula can be satisfied by a set of truth values. A Boolean formula is a mathematical formula that consists of a set of variables, each of which can take on one of two values, true or false. The problem is to determine whether there exists a set of truth values for the variables that makes the formula true.

French

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

Les problèmes de satisfaisabilité booléenne, généralement abrégés à problèmes SAT, sont des problèmes de satisfaction de contraintes ...

Spanish

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: