A SAT solver is an algorithm for establishing satisfiability. It takes the Boolean logic formula as input and returns SAT if it finds a combination of variables that can satisfy it or UNSAT if it can demonstrate that no such combination exists.

Where are SAT solvers used?

SAT solvers are becoming much more common these days, especially in software like package managers. Eclipse embeds SAT4j to manage dependencies among its plugins. Other applications of SAT typically include model checking, planning applications, configurators, scheduling, and many others.

Is SAT solvable?

Self-reducibility. The SAT problem is self-reducible, that is, each algorithm which correctly answers if an instance of SAT is solvable can be used to find a satisfying assignment. ... In total, n+1 runs of the algorithm are required, where n is the number of distinct variables in Φ.