Maximum Satisfiability
Published in Handbook of Satisfiability • Feb 2, 2021
Authors:,,
F. Bacchus
Matti Järvisalo
Ruben Martins
Abstract
Maximum satisfiability (MaxSAT) is an optimization version of SAT that is solved by finding an optimal truth assignment instead of just a satisfying one. In MaxSAT the objective function to be optimized is specified by a set of weighted soft clauses: the objective value of a truth assignment is the ...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!