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

Boolean Satisfiability Problem - Is the Boolean satisfiability problem unsolvable?


There is general agreement that the Boolean Satisfiability Problem (SAT) is infamously difficult to resolve. Its goal is to discover a way to make a Boolean formula true by assigning truth values to its variables. Finding out if a given logical phrase is satisfiable is its primary goal.