skip to main content

Artificial Intelligence Thesaurus

Search from vocabulary

Lengua del contenido

| français English
Ayuda para la búsqueda

Concept information

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

TÉRMINO PREFERIDO

Boolean satisfiability problem  

DEFINICIÓN

  • 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/ )

CONCEPTO GENÉRICO

CONCEPTOS RELACIONADOS

ETIQUETA ALTERNATIVA (SKOS)

  • SAT problem

EN OTRAS LENGUAS

URI

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

Descargue este concepto:

RDF/XML TURTLE JSON-LD última modificación 8/9/25