Definition:CNF Satisfiability Problem

Problem
Let $P$ be a boolean satisfiability problem whose set $L$ of propositional formulas are in conjunctive normal form.

Then $P$ is a conjunctive normal form boolean satisfiability problem.

Also known as
A Conjunctive normal form boolean satisfiability problem is also known for short as a CNF satisfiability problem or a CNF SAT problem.

Also see

 * Definition:Conjunctive Normal Form


 * CNF Satisfiability Problem is NP-Complete