SAT solvers, also known as Boolean satisfiability solvers, are software tools used to solve the Boolean satisfiability problem (SAT). The SAT problem involves determining if there exists an assignment of truth values (true or false) to a set of Boolean variables that satisfies a given Boolean formula.

A Boolean formula is composed of variables, logical connectives (such as AND, OR, and NOT), and parentheses to specify the order of operations. The goal is to find an assignment of truth values that makes the entire formula evaluate to true.