Boolean satisfiability (SAT)-the problem of determining whether there exists an assignment
satisfying a given Boolean formula-is a fundamental intractable problem in computer …

We give the first time-space tradeoff lower bounds for Resolution proofs that apply to
superlinear space. In particular, we show that there are formulas of size N that have …

Linear integer constraints are one of the most important constraints in combinatorial
problems since they are commonly found in many practical applications. Typically, encoding …

Boolean SAT solvers are indispensable tools in a variety of domains in computer science
and engineering where efficient search is required. Not only does this relieve the burden on …

In this paper, we revisit an important issue of CDCL-based SAT solvers, namely the learned
clauses database management policies. Our motivation takes its source from a simple …

We present a new ASP solver for ground ASP programs that builds upon related techniques,
originally introduced for SAT solving, which have been extended to cope with disjunctive …

Abstract Conflict-Driven Clause-Learning (CDCL) SAT solvers can automatically solve very
large real-world problems. To go beyond, and in particular in order to solve and optimize …

Satisfiability testing (SAT) is used to solve many academic and industrial problems from the
complexity class NP, for example hardware verification or scheduling [1]. The described …

In this paper we propose a new approach to share information among the computation units
of an iterative search partitioning parallel SAT solver by approximating validity. Experimental …

We present a new extended resolution clause learning (ERCL) algorithm, implemented as
part of a conflict-driven clause-learning (CDCL) SAT solver, wherein new variables are …