Satisfiability is a fundamental concept in mathematical logic and theoretical computer science concerning the existence of truth assignments for logical formulas. It investigates the decision problem of whether there exists an interpretation (an assignment of values to variables) under which a given formula evaluates to true, most notably studied in the context of the Boolean Satisfiability Problem (SAT), a canonical NP-complete problem with profound implications for complexity theory, automated reasoning, and formal verification.