In logic and computer science, the (sometimes called propositional satisfiability problem and abbreviated SATISFIABILITY, SAT or B-SAT) the problem of determining if there exists an interpretation that satisfies a given Boolean formula.

In computational complexity theory, the maximum satisfiability problem is the problem of determining the maximum number of clauses, of a given Boolean formula in conjunctive normal form, that can be made true by an assignment of truth values to the variables of the formula.

In theoretical computer science, the circuit satisfiability problem (also known as CIRCUIT-SAT, CircuitSAT, CSAT, etc.) is the decision problem of determining whether a given Boolean circuit has an assignment of its inputs that makes the output true.