Boolean satisfiability problem
The Boolean satisfiability is a kind of problem in math-based .In, a is satisfiable if the variables it uses can be given values so that it becomes true. If however for a given formula, no values exist so that the formula becomes true and the formula will always be f values its variables have it is called "unsatisfiable".