A decision procedure is an algorithm that, given a decision problem, terminates with a
correct yes/no answer. In this book, we focus on decision procedures for decidable first …

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 …

In this paper, we propose a canonical prune-and-SAT (CP&SAT) attack for breaking state-of-
the-art routing-based obfuscation techniques. In the CP&SAT attack, we first encode the key …

Preprocessing has become a key component of the Boolean satisfiability (SAT) solving
workflow. In practice, preprocessing is situated between the encoding phase and the solving …

Divide and Conquer: Towards Faster Pseudo-Boolean Solving Page 1 Divide and Conquer:
Towards Faster Pseudo-Boolean Solving Jan Elffers KTH Royal Institute of Technology …

Satisfiability (SAT) solvers have been using the same input format for decades: a formula in
conjunctive normal form. Cardinality constraints appear frequently in problem descriptions …

The dramatic improvements in combinatorial optimization algorithms over the last decades
have had a major impact in artificial intelligence, operations research, and beyond, but the …

Mutex propagation is a form of efficient constraint propagation popularly used in AI planning
to tightly approximate the reachable states from a given state. We utilize this idea in the …

It is well known that different solution strategies work well for different types of instances of
hard combinatorial problems. As a consequence, most solvers for the propositional …

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 …