Maximum satisfiability problem

The Maximum Satisfiability Problem (Max-SAT) is an optimization variant of the Boolean satisfiability problem (SAT). In the standard SAT problem, the goal is to determine whether there exists an assignment of truth values (true or false) to a set of variables such that a given Boolean formula evaluates to true.