Beside the important progresses observed in SAT solving, a number of applications
explicitly rely on incremental SAT solving only. In this paper, we focus on refining the …

The way CDCL SAT solvers find a satisfying assignment is very different from the way they
prove unsatisfiability. We propose an explanation to the difference by identifying direct …

Managing learnt clauses among a parallel, memory shared, SAT solver is a crucial but
difficult task. Based on some statistical experiments made on learnt clauses, we propose a …

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 …

Managing learnt clause database is known to be a tricky task in SAT solvers. In the portfolio
framework, the collaboration between threads through learnt clause exchange makes this …

In earlier work on a limited form of extended resolution for CDCL based SAT solving, new
literals were introduced to factor out parts of learned clauses. The main goal was to shorten …

The concepts of MSS (Maximal Satisfiable Subset) andCoMSS (also called Minimal
Correction Subset) playa key role in many AI approaches and techniques. Inthis paper, a …

We present and evaluate AmPharoS, a new parallel SAT solver based on the divide and
conquer paradigm. This solver, designed to work on a great number of cores, runs workers …

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 formalism that models the computation of clause sharing portfolio solvers with
inprocessing. The soundness of these solvers is not a straightforward property since shared …