Definition
Maximum Satisfiability Problem
The maximum SAT problem is a an optimisation problem variant of SAT that aims to maximise the number of satisfied clauses.
It’s NP-complete Problem.
Maximum Satisfiability Problem
The maximum SAT problem is a an optimisation problem variant of SAT that aims to maximise the number of satisfied clauses.
It’s NP-complete Problem.