Since its first use by Euler on the problem of the seven bridges of Königsberg, graph theory
has shown excellent abilities in solving and unveiling the properties of multiple discrete …

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 …

Abstract Maximum Satisfiability (MaxSAT) is a basic and important constraint optimization
problem. When dealing with both hard and soft constraints, the MaxSAT problem is referred …

Abstract Partial MaxSAT (PMS) generalizes SAT and MaxSAT by introducing hard clauses
and soft clauses. PMS and Weighted PMS (WPMS) have many important real world …

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

Weighted maximum satisfiability and (unweighted) partial maximum satisfiability (PMS) are
two significant generalizations of maximum satisfiability (MAX-SAT), and weighted partial …

Given an over-constrained system, a Maximal Satisfiable Subset (MSS) denotes a maximal
set of constraints that are consistent. A Minimal Correction Subset (MCS, or co-MSS) is the …

Covering arrays (CAs) are often used as test suites for combinatorial interaction testing to
discover interaction faults of real-world systems. Most real-world systems involve constraints …

We address Partial MaxSAT (PMS) and Weighted PMS (WPMS), two practical
generalizations of the MaxSAT problem, and propose a local search algorithm for these …

This paper introduces a new anytime algorithm for Weighted MaxSAT consisting of two main
algorithmic components. First, we propose a new efficient polarity selection heuristic and an …