One of the most important paradigm shifts in the use of SAT solvers for solving industrial
problems has been the introduction of clause learning. Clause learning entails adding a …

Recent work proposed a toolkit PySAT aiming at fast and easy prototy** with propositional
satisfiability (SAT) oracles in Python, which enabled one to exploit the power of the original …

This paper presents open-wbo, a new MaxSAT solver. open-wbo has two main features.
First, it is an open-source solver that can be easily modified and extended. Most MaxSAT …

Abstract Maximum Satisfiability (MaxSAT) is a prototypical constraint optimization problem,
and its generalized version is the (Weighted) Partial MaxSAT problem, denoted as (W) PMS …

Abstract Maximum Satisfiability (MaxSAT) is an optimization version of SAT, and many real
world applications can be naturally encoded as such. Solving MaxSAT is an important …

Maxsat is an optimization version of Satisfiability aimed at finding a truth assignment that
maximizes the satisfaction of the theory. The technique of solving a sequence of SAT …

Core-guided approaches to solving MAXSAT have proved to be effective on industrial
problems. These approaches solve a MAXSAT formula by building a sequence of SAT …

Many industrial optimization problems can be translated to MaxSAT. Although the general
problem is NP hard, like SAT, many practical problems may be solved using modern …

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 …

We present a partial Max-SAT solver QMaxSAT which uses CNF encoding of Boolean
cardinality constraints. The old version 0.1 was obtained by adapting a CDCL based SAT …