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 …

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 …

Current Max-SAT solvers are able to efficiently compute the optimal value of an input
instance but they do not provide any certificate of its validity. In this paper, we present a tool …

Branch and bound (BnB) solvers for Max-SAT count at each node of the search tree the
number of disjoint inconsistent subsets to compute the lower bound. In the last ten years …

Adapting a resolution proof for SAT to a Max-SAT resolution proof without increasing
considerably the size of the proof is an open question. This paper contributes to this topic by …

Many problems that arise in the real world are difficult to solve partly because they present
computational challenges. Many of these challenging problems are optimization problems …

In this paper, we are interested in proof systems for Max-SAT and particularly in the
construction of Max-SAT equivalence-preserving transformations to infer information from a …

Adapting a resolution refutation for SAT into a Max-SAT resolution refutation without
increasing considerably the size of the refutation is an open question. This paper contributes …

Branch and Bound solvers for Max-SAT are very efficient on random and some crafted
instances, as shown in the recent Max-SAT Evaluation results. However, on structured …

Signed clausal forms offer a suitable logical framework for automated reasoning in multiple-
valued logics. It turns out that the satisfiability problem of any finitely-valued propositional …