SAT solvers are algorithms designed to determine the satisfiability of boolean formulas. A boolean formula is a mathematical expression made up of variables that can be true or false. The primary goal of a SAT solver is to find an assignment of truth values to these variables that makes the entire formula true. These solvers are widely used in various fields, including computer science, artificial intelligence, and hardware verification. They help in solving complex problems such as circuit design and software testing by efficiently exploring possible variable assignments and identifying solutions or proving unsatisfiability.