This system description describes our new SAT solver KISSAT, how it differs from CADICAL,
as well as changes made to CADICAL. We further present our new distributed cubeand …

The Boolean satisfiability problem (SAT) is a fundamental NP-complete decision problem in
automated reasoning and mathematical logic. As evidenced by the results of SAT …

In this article we describe and evaluate optimized compact data structures for watching
literals. Experiments with our SAT solver PicoSAT show that this low-level optimization not …

We introduce in this paper a lightweight technique for reducing work repetition caused by
non–chronological backtracking commonly practiced by DPLL–based SAT solvers. The …

Preprocessing has become a key component of the Boolean satisfiability (SAT) solving
workflow. In practice, preprocessing is situated between the encoding phase and the solving …

The research community on complex networks has developed techniques of analysis and
algorithms that can be used by the SAT community to improve our knowledge about the …

Modern SAT solvers have experienced a remarkable progress on solving industrial
instances. It is believed that most of these successful techniques exploit the underlying …

There are two important challenges for local search algorithms when applied to Maximal
Satisfiability (MAXSAT). 1) Local search spends a great deal of time blindly exploring …

SAT-solvers have turned into essential tools in many areas of applied logic like, for example,
hardware verification or satisfiability checking modulo theories. However, although recent …

Functional validation is widely acknowledged as a major challenge for multicore
architectures. Directed tests are promising since a significantly smaller number of directed …