skip to main content

Artificial Intelligence Thesaurus

Search from vocabulary

Content language

| español français
Search help

Concept information

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

PREFERRED TERM

Boolean satisfiability problem  

DEFINITION(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/ )

BROADER CONCEPT(S)

RELATED CONCEPT(S)

SYNONYM(S)

  • SAT problem

IN OTHER LANGUAGES

URI

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

Download this concept:

RDF/XML TURTLE JSON-LD Last modified 9/8/25