TERMIUM Plus^®

Fiche 1,  Justifications,  Anglais

Record number: 1, Textual support number: 1 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.  3, fiche 1, Anglais, - Boolean%20satisfiability%20problem

Fiche 1,  Justifications,  Français

Record number: 1, Textual support number: 1 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 ...  4, fiche 1, Français, - probl%C3%A8me%20de%20satisfaisabilit%C3%A9%20bool%C3%A9enne

Fiche 1,  Justifications,  Espagnol