The Boolean satisfiability problem (SAT) is a fundamental NP-complete decision problem in
automated reasoning and mathematical logic. As evidenced by the results of SAT …

Abstract The Boolean Satisfiability (SAT) problem is the canonical NP-complete problem
and is fundamental to computer science, with a wide array of applications in planning …

Parameterized complexity is a new theoretical framework that considers, in addition to the
overall input size, the effects on computational complexity of a secondary measurement, the …

Despite the success of CDCL SAT solvers solving industrial problems, there are still many
open questions to explain such success. In this context, the generation of random SAT …

Modern CDCL SAT solvers easily solve industrial instances containing tens of millions of
variables and clauses, despite the theoretical intractability of the SAT problem. This gap …

Circuit obfuscation is a recently proposed defense mechanism to protect the intellectual
property (IP) of digital integrated circuits (ICs) from reverse engineering. There have been …

In the last decades, we have witnessed a remarkable success of algorithms solving the
Boolean Satisfiability problem (SAT) on instances encoding application or real-world …

Effective evaluation of learnt clauses is crucial for the performance of conflict-driven clause
learning SAT solvers. We propose a novel learnt clause evaluation method using the …

Satisfiability is considered the canonical NP‐complete problem and is used as a starting
point for hardness reductions in theory, while in practice heuristic SAT solving algorithms …

We study non-uniform random k-SAT on n variables with an arbitrary probability distribution
pp on the variable occurrences. The number t= t (n) t= t (n) of randomly drawn clauses at …