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 …

MaxSAT solving is becoming a competitive generic approach for solving combinatorial
optimization problems, partly due to the development of new solving techniques that have …

Lifting a recent proposal by Moreno-Centeno and Karp, we propose a general framework for
so-called implicit hitting set algorithms for reasoning beyond NP. The framework is motivated …

Abstract Weighted Partial MaxSAT (WPMS) is a well-known optimization variant of Boolean
Satisfiability (SAT) that finds a wide range of practical applications. WPMS divides the …

Despite their similarities, MaxSAT and MinSAT use different encodings and solving
techniques to cope with optimization problems. In this paper we describe a new weighted …

Abstract Maximum Independent Set (MIS) is a well-known NP-hard graph problem, tightly
related with other well known NP-hard graph problems, namely Minimum Vertex Cover …

There is a well-known approach to cope with NP-hard problems in practice: reduce the
given problem to SAT or MAX-SAT and run a SAT or a MAX-SAT solver. This method is very …

We describe an exact inference-based algorithm for the MinSAT problem. Given a multiset of
clauses C, the algorithm derives as many empty clauses as the maximum number of clauses …

Abstract Similarly to Maximum Satisfiability (MaxSAT), Minimum Satisfiability (MinSAT) is an
optimization extension of the Boolean Satisfiability (SAT) decision problem. In recent years …

Linear search algorithms have been shown to be particularly effective for solving partial
Maximum Satisfiability (MaxSAT) problem instances. These algorithms start by adding a new …