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 …

Within the Electronic Design Automation (EDA) domain, AI-driven solutions have emerged
as formidable tools, yet they typically augment rather than redefine existing methodologies …

Within the electronic design automation (EDA) domain, artificial intelligence (AI)-driven
solutions have emerged as formidable tools, yet they typically augment rather than redefine …

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 …

We propose effective algorithms for exact synthesis of Boolean logic networks using
satisfiability modulo theories (SMTs) solvers. Since exact synthesis is a difficult problem, it …

Boolean satisfiability (SAT) and its extensions are becoming a core technology for the
analysis of systems. The SAT-based approach divides into three steps: encoding …

Autonomous search is a particular case of adaptive systems that improve their solving
performance by modifying and adjusting themselves to the problem at hand, either by self …

Quantum annealers (QAs) are specialized quantum computers that minimize objective
functions over discrete variables by physically exploiting quantum effects. Current QA …

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

We present the key ideas in the design and implementation of Beaver, an SMT solver for
quantifier-free finite-precision bit-vector logic (QF_BV). Beaver uses an eager approach …