The satisfiability problem for Constraint Satisfaction Problems
(CSPs) asks whether an instance of a CSP has a fully satisfying
assignment, i.e., an assignment that satisfies all constraints.
This problem is known to be in class P or is NP-complete...