e/Maximum satisfiability problem

Information
has gloss	eng: In computational complexity theory, the Maximum Satisfiability problem, or MAX-SAT, is the problem of determining the maximum number of clauses, of a given Boolean formula, that can be satisfied by any assignment.
lexicalization	eng: maximum satisfiability problem
instance of	c/Satisfiability problems