Algorithms for Weighted Boolean Optimization

Abstract

The Pseudo-Boolean Optimization (PBO) and Maximum Satisfiability (MaxSAT) problems are natural optimization extensions of Boolean Satisfiability (SAT). In the recent past, different algorithms have been proposed for PBO and for MaxSAT, despite the existence of straightforward mappings from PBO to MaxSAT and viceversa. This papers proposes Weighted Boolean Optimization (WBO), a new unified framework that aggregates and extends PBO and MaxSAT. In addition, the paper proposes a new unsatisfiability-based algorithm for WBO, based on recent unsatisfiability-based algorithms for MaxSAT. Besides standard MaxSAT, the new algorithm can also be used to solve weighted MaxSAT and PBO, handling pseudoBoolean constraints either natively or by translation to clausal form. Experimental results illustrate that unsatisfiability-based algorithms for MaxSAT can be orders of magnitude more efficient than existing dedicated algorithms. Finally, the paper illustrates how other algorithms for either PBO or MaxSAT can be extended to WBO.

DOI: 10.1007/978-3-642-02777-2_45

Extracted Key Phrases

4 Figures and Tables

0204020102011201220132014201520162017
Citations per Year

146 Citations

Semantic Scholar estimates that this publication has 146 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Manquinho2009AlgorithmsFW, title={Algorithms for Weighted Boolean Optimization}, author={Vasco M. Manquinho and Joao Marques-Silva and Jordi Planes}, booktitle={SAT}, year={2009} }