The decision problem for Boolean satisfiability, generally referred to as SAT, is the
archetypal NP-complete problem, and encodings of many problems of practical interest exist …

Boolean satisfiability (SAT) solvers are currently very effective in practice. However, there
are still many challenging problems for SAT solvers. Nowadays, extra computational power …

The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in
not just the theoretical computer science community, but also in areas where practical …

Pseudo-Boolean and cardinality constraints are a natural generalization of clauses. While a
clause expresses that at least one literal must be true, a cardinality constraint expresses that …

In this paper we introduce MiniMaxSat, a new Max-SAT solver that is built on top of MiniSat+.
It incorporates the best current SAT and Max-SAT techniques. It can handle hard clauses …

Combinatorial Optimization is an important area of computer science that has many
theoretical and practical applications. In this thesis, we present important contributions to …

In this paper we introduce MiniMaxSat, a new Max-SAT solver that incorporates the best
SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction …

SAT Competition 2002 held in March–May 2002 in conjunction with SAT 2002 (the Fifth
International Symposium on the Theory and Applications of Satisfiability Testing). About 30 …

One of the main reasons for the widespread use of SAT in many applications is that Conflict-
Driven Clause Learning (CDCL) Boolean Satisfiability (SAT) solvers are so effective in …

Abstract The Boolean Satisfiability Problem (SAT) is well known in computational
complexity, representing the first decision problem to be proved NP-complete. SAT is also …