Sat4j is a mature, open source library of SAT-based solvers in Java. It provides a modular
SAT solver architecture designed to work with generic constraints. Such architecture is used …

Heterogeneous reconfigurable systems provide drastically higher performance and lower
power consumption than traditional CPU-centric systems. Moreover, they do it at much lower …

Boolean Satisfiability (SAT) has seen many successful applications in various fields such as
Electronic Design Automation and Artificial Intelligence. However, in some cases, it may be …

Over the years, the fundamentals of VLSI technology have evolved to include a wide range
of topics and a broad range of practices. To encompass such a vast amount of knowledge …

Designing an application-specific embedded system in nanometer technologies has
become more difficult than ever due to the rapid increase in design complexity and …

We introduce SATIRE, a new satisfiability solver that is particular-ly suited to verification and
optimization problems in electronic de-sign automation. SATIRE builds on the most recent …

Pseudo-Boolean and cardinality constraints are a natural generalization of clauses. While a
clause expresses that at least one literal must be true, a cardinality constraint expresses that …

Abstract The Pseudo-Boolean Optimization (PBO) and Maximum Satisfiability (MaxSAT)
problems are natural optimization extensions of Boolean Satisfiability (SAT). In the recent …

Boolean Satisfiability (SAT) is often used as the underlying model for a significant and
increasing number of applications in Electronic Design Automation (EDA) as well as in many …

Randomizing polynomials allow representing a function f (x) by a low-degree randomized
mapping ̂ f (x, r) whose output distribution on an input x is a randomized encoding of f (x). It …