Algorithms for Weighted Boolean Optimization
Vasco M. Manquinho,Joao Marques-Silva,Jordi Planes +2 more
- 29 Jun 2009
- pp 495-508
TL;DR: Weighted Boolean Optimization (WBO) is proposed, a new unified framework that aggregates and extends PBO and MaxSAT and a new unsatisfiability-based algorithm for WBO, based on recent unsatisfiable algorithms for MaxSat.
read more
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 vice-versa. 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 pseudo-Boolean 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
Citations
Open-WBO: A Modular MaxSAT Solver ,
Ruben Martins,Vasco M. Manquinho,Inês Lynce +2 more
- 14 Jul 2014
TL;DR: This paper presents open-wbo, a new MaxSAT solver, an open-source solver that can be easily modified and extended that may use any MiniSAT-like solver as the underlying SAT solver.
SAT-based MaxSAT algorithms
TL;DR: This paper presents several algorithms specially designed to deal with industrial or real problems based on the idea of solving MaxSAT through successive calls to a SAT solver, and shows that this SAT-based technique is efficient in solving industrial problems.
194
Solving MAXSAT by solving a sequence of simpler SAT instances
Jessica Davies,Fahiem Bacchus +1 more
- 12 Sep 2011
TL;DR: This paper introduces a new MAXSAT algorithm that solves a sequence of SAT instances and can, however, require solving more SAT instances than previous approaches, which is simpler than previous methods and displays superior performance on some benchmarks.
•Proceedings Article
Maximum satisfiability using core-guided MAXSAT resolution
Nina Narodytska,Fahiem Bacchus +1 more
- 27 Jul 2014
TL;DR: Using compressed MAXSAT resolution, this work proposes a new core-guided solver that improves the state-of-the-art, solving significantly more problems than other state of theart solvers on the industrial benchmarks used in the 2013 MAXSat Solver Evaluation.
164
QMaxSAT: A Partial Max-SAT Solver
TL;DR: A partial Max-SAT solver QMaxSAT is presented which uses CNF encoding of Boolean cardinality constraints and is compared to the old version 0.1 which was obtained by adapting a CDCL based SAT solver MiniSat to manage cardinalities constraints.
References
Paths, Trees, and Flowers
TL;DR: A graph G is a set of elements called vertices and a finite set of edges called edges such that each edge meets exactly two vertices, called the end-points of the edge as mentioned in this paper.
Translating Pseudo-Boolean Constraints into SAT
Niklas Een,Niklas Sörensson +1 more
TL;DR: By applying a proper mix of translation techniques, a SAT-solver can perform on a par with the best existing native pseudo-boolean solvers, particularly valuable in cases where the constraint problem of interest is naturally expressed as a SAT problem, except for a handful of constraints.
•Journal Article
On solving the partial MAX-SAT problem
Zhaohui Fu,Sharad Malik +1 more
TL;DR: Two solvers are implemented for the Partial MAX-SAT problem; the relative strengths and thus applicability of the two solvers for different solution scenarios are discussed and how both techniques benefit from the persistent learning techniques of incremental SAT.
266
On solving the partial MAX-SAT problem
Zhaohui Fu,Sharad Malik +1 more
- 12 Aug 2006
TL;DR: In this paper, the Partial MAX-SAT problem is considered and two algorithms are proposed to solve it: a diagnosis-based algorithm and an encoding-based one, where the diagnosis algorithm iteratively analyzes the UNSAT core of the current SAT instance and eliminates the core through a modification of the problem instance by adding relaxation variables.
260
A fast pseudo-Boolean constraint solver
Donald Chai,Andreas Kuehlmann +1 more
- 02 Jun 2003
TL;DR: This paper reviews how recent advances in satisfiability search can be extended for pseudo-Boolean constraints and describes a new LPB solver that is based on generalized constraint propagation and conflict-based learning and presents a comparison with other, state-of-the-art LPBsolvers.