On Using Unsatisfiability for Solving Maximum Satisfiability

Simple item page
dc.creatorMarques-Silva, Joao
dc.creatorPlanes, Jordi
dc.date2007-12-07
dc.date.accessioned2026-07-07T08:47:54Z
dc.date.available2026-07-07T08:47:54Z
dc.descriptionMaximum Satisfiability (MaxSAT) is a well-known optimization pro- blem, with several practical applications. The most widely known MAXS AT algorithms are ineffective at solving hard problems instances from practical application domains. Recent work proposed using efficient Boolean Satisfiability (SAT) solvers for solving the MaxSAT problem, based on identifying and eliminating unsatisfiable subformulas. However, these algorithms do not scale in practice. This paper analyzes existing MaxSAT algorithms based on unsatisfiable subformula identification. Moreover, the paper proposes a number of key optimizations to these MaxSAT algorithms and a new alternative algorithm. The proposed optimizations and the new algorithm provide significant performance improvements on MaxSAT instances from practical applications. Moreover, the efficiency of the new generation of unsatisfiability-based MaxSAT solvers becomes effectively indexed to the ability of modern SAT solvers to proving unsatisfiability and identifying unsatisfiable subformulas.
dc.identifierhttps://arxiv.org/abs/0712.1097
dc.identifierhttp://arxiv.org/abs/0712.1097
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/143765
dc.subjectArtificial Intelligence
dc.subjectData Structures and Algorithms
dc.titleOn Using Unsatisfiability for Solving Maximum Satisfiability
dc.typetext

Files

Collections

arXiv