Maximize the number of satisfied disjunctions
You are addressing a problem of the same type. if you use De Morgan law your problem will become MIN-SAT which is  NP-HARD

checkout THE MINIMUM SATISFIABILITY PROBLEM