skip to main content

Artificial Intelligence Thesaurus

Choisissez le vocabulaire dans lequel chercher

Langue des données

| español English
Aide à la recherche

Concept information

method of artificial intelligence > logic > propositional logic > Boolean satisfiability problem

TERME PRÉFÉRENTIEL

Boolean satisfiability problem  

DÉFINITION(S)

  • the satisfaction problem in propositional logic consists in determining whether a formula, expressed in propositional logic, is true or false. This problem is very important in computer science, as it constitutes the reference for problems that are difficult to solve (which is the subject of algorithmic complexity theory). It provides a reference for solving/studying problems that are reducible to it or to which it is reducible, such as the verification of software, microprocessors or complex systems. (Source: translated from https://ia.gdria.fr/Glossaire/probleme-sat/ )

CONCEPT(S) GÉNÉRIQUE(S)

CONCEPT(S) ASSOCIÉ(S)

SYNONYME(S)

  • SAT problem

TRADUCTIONS

URI

http://data.loterre.fr/ark:/67375/23L-RM5PWC50-6

Télécharger ce concept:

RDF/XML TURTLE JSON-LD Dernière modif. 08/09/2025