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 …

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 …

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), the optimisation extension of the well-known
Boolean Satisfiability (SAT) problem, is a competitive approach for solving NP-hard …

A central challenge in software analysis concerns balancing different competing tradeoffs.
To address this challenge, we propose an approach based on the Maximum Satisfiability …

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 …

The problem of propositional satisfiability (SAT) has found a number of applications in both
theoretical and practical computer science. In many applications, however, knowing a …

Boolean Satisfiability (SAT) is arguably the archetypical NP-complete decision problem.
Progress in SAT solving algorithms has motivated an ever increasing number of practical …

This paper presents the Quick Error Detection (QED) technique for systematically creating
families of post-silicon validation tests that quickly detect bugs inside processor cores and …

Integration of the fields of constraint solving and data mining and machine learning has
recently been identified within the AI community as an important research direction with high …