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 …

The DRAT-trim tool is a satisfiability proof checker based on the new DRAT proof format.
Unlike its predecessor, DRUP-trim, all presently known SAT solving and preprocessing …

Decision procedures for Boolean satisfiability (SAT), especially modern conflict-driven
clause learning (CDCL) solvers, act routinely as core solving engines in various real-world …

This chapter gives an overview of proof complexity and connections to SAT solving, focusing
on proof systems such as resolution, Nullstellensatz, polynomial calculus, and cutting planes …

Modern SAT solvers use preprocessing and inprocessing techniques that are not solely
based on resolution; existing unsatisfiability proof formats do not support SAT solvers using …

Incremental SAT is about solving a sequence of related SAT problems efficiently. It makes
use of already learned information to avoid repeating redundant work. Also preprocessing …

We present a novel preprocessing technique to automatically reduce the size of Boolean
formulas. This technique, called Bounded Variable Addition (BVA), exchanges clauses for …

Boolean satisfiability (SAT) solving is one of the most competitive research areas of
theoretical computer science. The performance of state-of-the-art SAT solvers has been …

We introduce proof systems for propositional logic that admit short proofs of hard formulas as
well as the succinct expression of most techniques used by modern SAT solvers. Our proof …

Adding and removing redundant clauses is at the core of state-of-the-art SAT solving.
Crucial is the ability to add short clauses whose redundancy can be determined in …