It has been widely observed that there is no single" dominant" SAT solver; instead, different
solvers perform best on different instances. Rather than following the traditional approach of …

In this work, we improve on existing results on the relationship between proof systems
obtained from conflict-driven clause-learning SAT solvers and general resolution. Previous …

It has been widely observed that there is no “dominant” SAT solver; instead, different solvers
perform best on different instances. Rather than following the traditional approach of …

A variety of tasks in formal verification require finding small or minimal unsatisfiable cores
(subsets) of an unsatisfiable set of constraints. This paper proposes two algorithms for …

Abstract The Boolean Satisfiability Problem (SAT) is a canonical decision problem originally
shown to be NP-complete in Cook's seminal work on the theory of computational complexity …

Empirical studies often observe that the performance of algorithms across problem domains
can be quite uncorrelated. When this occurs, it seems practical to investigate the use of …

Most or even all competitive DPLL-based SAT solvers have a “restart” policy, by which the
solver is forced to backtrack to decision level 0 according to some criterion. Although not a …

We show that modern conflict-driven SAT solvers implicitly build and prune a decision tree
whose nodes are associated with flipped variables. Practical usefulness of conflict-driven …

ABSTRACT Formal Equivalence Checking (FEC) is a technique that formally proves the
equivalence of a schematics implementation against a golden RTL model. This equivalence …

Propositional satisfiability (SAT) is the problem of determining, for a formula in propositional
calculus, whether a satisfying assignment for its variables exists. SAT holds a central place …