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

Boolean Satisfiability Problem - What is the Boolean satisfiability problem in SAT solver?


If there is an assignment, called a satisfactory assignment, that makes the formula true, then we say that the formula is satisfiable. Determining the satisfiability of a given Boolean formula is the goal of the Boolean Satisfiability issue (SAT), a decision issue. We call this issue NP-complete.