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 …

This chapter gives an overview of proof complexity and connections to SAT solving, focusing
on proof systems such as resolution, Nullstellensatz, polynomial calculus, and cutting planes …

Propositional satisfiability (SAT) is at the nucleus of state-of-the-art approaches to a variety
of computationally hard problems, one of which is cryptanalysis. Moreover, a number of …

This paper is intended as an informal and accessible survey of proof complexity for non-
experts, focusing on some comparatively weak proof systems of particular interest in …

Many studies focus on the generation of hard SAT instances. The hardness is usually
measured by the time it takes SAT solvers to solve the instances. In this preliminary study …

Pebble games were extensively studied in the 1970s and 1980s in a number of different
contexts. The last decade has seen a revival of interest in pebble games coming from the …

The paper proposes a probabilistic generalization of the well-known Strong Backdoor Set
(SBS) concept applied to the Boolean Satisfiability Problem (SAT). We call a set of Boolean …

There have been recent efforts for incorporating Graph Neural Network models for learning
full-stack solvers for constraint satisfaction problems (CSP) and particularly Boolean …

Nowadays, modern SAT solvers are able to efficiently solve many industrial, or real-world,
SAT instances. However, the process of development and testing of new SAT solving …

Propositional satisfiability (SAT) solvers are deemed to be among the most efficient
reasoners, which have been successfully used in a wide range of practical applications. As …