We survey recent work on neurosymbolic programming, an emerging area that bridges the
areas of deep learning and program synthesis. Like in classic machine learning, the goal …

As multi-core computing is now standard, it seems irresponsible for constraints researchers
to ignore the implications of it. Researchers need to address a number of issues to exploit …

Since 2013, the leading SAT solvers in the SAT competition all use inprocessing, which
unlike preprocessing, interleaves search with simplifications. However, applying …

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

The parallel computing power offered by graphic processing units (GPUs) has been recently
exploited to support general purpose applications–by exploiting the availability of general …

Boolean Satisfiability (SAT) is a problem that holds great importance both theoretically and
in practical applications. Although the general SAT problem is NP-complete, advancements …

With the ever-increasing hardware design complexity comes the realization that efforts
required for hardware verification increase at an even faster rate. Driven by the push from …

As the complexity and scope of VLSI designs continue to grow, fault detection processes in
the pre-silicon stage have become crucial to guaranteeing reliability in IC design. Most fault …

As growing complexity of digital VLSI circuits, fault detection and correction processes have
been the most crucial phases during IC design. Many CAD tools and formal approaches …

We propose a novel solver that efficiently finds almost the exact number of solutions of a
Boolean formula (# Sat) and the weighted model count of a weighted Boolean formula …