The Boolean Satisfiability Problem is the problem of knowing if a boolean formula is satisfiable, meaning that it exists a boolean assignation to the variables such that the formula evaluates to .
For example, the formula: #todo
tags:#computation-theory/logic see also: SMT - Satisfiability Modulo Theories