New Upper Bounds for Maximum Satisfiability

The (unweighted) Maximum Satisfiability problem (MaxSat) is: given a boolean formula in conjunctive normal form, find a truth assignment that satisfies the most number of clauses. This paper describes exact algorithms that provide new upper bounds for MaxSat.

• Type: Journal
• Year: 2000
• Where: JAL
• Authors: Rolf Niedermeier, Peter Rossmanith
• Keywords: Boolean Formula, Conjunctive Normal Form, JAL 2000, Maximum Satisfiability Problem