Boolean satisfiability problem (SAT)
A decision problem of determining
the satisfiability of a molecular statement,
typically in the conjunctive normal form.
A decision problem of determining
the satisfiability of a molecular statement,
typically in the conjunctive normal form.