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 …

Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two
relatively independent threads of research cross-fertilizing occasionally. These two …

Figure 1 shows the various steps of the search component. Given a set of query keywords,
the system first uses the symbol table to determine the locations within the database where …

Abstract Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a
first-order formula with respect to some decidable first-order theory T (SMT (T)). These …

The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in
not just the theoretical computer science community, but also in areas where practical …

3 4 5 6 7 8 9 10 11 2: 3: 14 15 16 17 8 19 add-to-basic-blks (entry-blk, cond); entryl as init-
basic-blk (); cxit1= creatc-basic-blk (entryl, statement 1); create edge (entry-blk, entryl, cond); …

The paper explores several ways to improve the speed and capacity of combinational
equivalence checking based on Boolean satisfiability (SAT). State-of-the-art methods use …

The choice of the variable to flip in the Walksat family procedures is always random in that it
is selected from a randomly chosen unsatisfied clause c. This choice in Novelty or R-Novelty …

In this paper, we describe a new method to identify the writer of Chinese handwritten
documents. There are many methods for signature verification or writer identification, but …

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