Satisfiability Problem

algorithms

Definition

Satisfiability Problem

The SAT problem is a decision problem that gets as input a CNF formula $\Phi$ and computes whether there exists a variable assignment that satisfies $\Phi$.