Boolean Satisfiability Problem (SAT or B-SAT)

SAT is the problem of determining the satisfiability a given Boolean formula.

ROAM_REFS: https://en.wikipedia.org/wiki/Boolean_satisfiability_problem