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

Much research in the area of constraint processing has recently been focused on extracting
small unsatisfiable “cores” from unsatisfiable constraint systems with the goal of finding …

Much effort is spent by programmers everyday in trying to reduce long, failing execution
traces to the cause of the error. We present an algorithm for error cause localization based …

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 …

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 a well-known optimization variant of propositional
Satisfiability (SAT). Motivated by a growing number of practical applications, recent years …

Abstract The Pseudo-Boolean Optimization (PBO) and Maximum Satisfiability (MaxSAT)
problems are natural optimization extensions of Boolean Satisfiability (SAT). In the recent …

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 …

The maximum satisfiability (MAX-SAT) problem, especially the weighted version, has
extensive applications. Weighted MAX-SAT instances encoded from real-world applications …

Many decision and optimization problems in Electronic Design Automation (EDA) can be
solved with Boolean Satisfiability (SAT). Moreover, well-known extensions of SAT also find …