Optimal assignment for an unsatisfiable formula

68 Views Asked by At

Given an unsatisfiable formula $F$ in CNF, are there any methods to find an assignment that can satisfy as many clauses as possible?

1

There are 1 best solutions below

0
On BEST ANSWER

This is the maximum satisfiability problem (MAX-SAT):

enter image description here

Source: