Dramatic improvements in SAT solver technology over the last decade and the growing
need for more efficient and scalable verification solutions have fueled research in …

The science of brute force Page 1 70 COMMUNICATIONS OF THE ACM | AUGUST 2017 |
VOL. 60 | NO. 8 review articles ILL US TRA TION B Y PETER CRO W THER A SSOCIA TE S …

Boolean satisfiability (SAT) solvers are at the core of efficient approaches for solving a vast
multitude of practical problems. Moreover, albeit targeting an NP-complete problem, SAT …

We introduce a new flexible paradigm of grounding and solving in Answer Set Programming
(ASP), which we refer to as multi-shot ASP solving, and present its implementation in the …

MathSAT is a long-term project, which has been jointly carried on by FBK-IRST and
University of Trento, with the aim of develo** and maintaining a state-of-the-art SMT tool …

The set of novelties introduced with the SAT solver Glucose is now considered as a standard
for practical SAT solving. In this paper, we review the different strategies and technologies …

Abstract Model checking is an automatic technique for verifying finite-state reactive systems,
such as sequential circuit designs and communication protocols. Specifications are …

A new form of SAT-based symbolic model checking is described. Instead of unrolling the
transition relation, it incrementally generates clauses that are inductive relative to (and …

In this article, we present a small, complete, and efficient SAT-solver in the style of conflict-
driven learning, as exemplified by Chaff. We aim to give sufficient details about …

Recent work proposed a toolkit PySAT aiming at fast and easy prototy** with propositional
satisfiability (SAT) oracles in Python, which enabled one to exploit the power of the original …