Simplest example. In MAXSAT, we try to find the assignment that maximizes the number of satisfied clauses. Thus, this makes sense even in cases where the formula can't be (completely) satisfied.
Just as hard as SAT. Why?
Can generalize this to make clauses worth different amounts.
How represent hard constraints in the weighted-clause case (ones that must not be violated)?
How would you solve it?
