Preprocessing SAT instances can reduce their size considerably. We combine variable
elimination with subsumption and self-subsuming resolution, and show that these …

Optimization solvers routinely utilize presolve techniques, including model simplification,
reformulation and domain reduction techniques. Domain reduction techniques are …

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 …

The choice of the variable to flip in the Walksat family procedures is always random in that it
is selected from a randomly chosen unsatisfied clause c. This choice in Novelty or R-Novelty …

It is well known that different solution strategies work well for different types of instances of
hard combinatorial problems. As a consequence, most solvers for the propositional …

Since 2013, the leading SAT solvers in SAT competitions all use inprocessing, which, unlike
preprocessing, interleaves search with simplifications. However, inprocessing is typically a …

This paper presents the CNF simplifier Coprocessor 2.0, an extension of Coprocessor [1]. It
implements almost all currently known simplification techniques in a modular way and …

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 …

The effective parallelisation of Bounded Model Checking is challenging, due to SAT and
SMT solving being hard to parallelise. We present ParaFROST, which is the first tool to …

We present a new preprocessing technique for propositional model counting. This technique
leverages definability, ie, the ability to determine that some gates are implied by the input …