Start free trial
Take Naologic for a spin today, no credit card needed and no obligations.
Start free trial

Boolean Satisfiability Problem - What is an example of a Boolean satisfiability?


Now think about the Boolean statement 'a AND NOT b'. The assignment of TRUE to a and FALSE to b makes the equation (a AND NOT b) equal to TRUE, hence this is satisfiable. The statement 'a AND NOT a', nevertheless, fails to meet the mark. According to the Cook-Levin theorem, the first issue to be proclaimed NP-complete was the Boolean Satisfiability issue, or SAT for short.