A SAT solver, or satisfiability solver, is a computational tool used to determine the satisfiability of propositional logic formulas. More specifically, it assesses whether there exists an assignment of truth values (true or false) to the variables of a given boolean formula such that the entire formula evaluates to true.
New to topics? Read the docs here!