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 …

We initiate a proof complexity theoretic study of subsystems of cutting planes (CP) modelling
proof search in conflict-driven pseudo-Boolean (PB) solvers. These algorithms combine …

Boolean satisfiability is a fundamental problem in computer science with a wide range of
applications including planning, configuration management, design and verification of …

The CDCL algorithm for SAT is equivalent to the resolution proof system under a few
assumptions, one of them being an optimal non-deterministic procedure for choosing the …

This paper presents new parallel strategies for preprocessing and solving the issue of
Boolean Satisfaction (SAT) on Heterogeneous systems of multicore and many-core CPU …

We prove that CDCL SAT-solvers with the ordered decision strategy and the DECISION
learning scheme are equivalent to ordered resolution. We also prove that, by replacing this …

In this note we show two results about k-DNF resolution. First we prove that there are CNF
formulas which require exponential length refutations in resolution extended with parities of …

While running times of ontology reasoners have been studied extensively, studies on energy-
consumption of reasoning are scarce, and the energy-efficiency of ontology reasoning is not …

We prove that conflict-driven clause learning (CDCL) SAT-solvers with the ordered decision
strategy and the DECISION learning scheme are equivalent to ordered resolution. We also …

In this thesis, we develop a framework of parametrised enumeration complexity. At first, we
provide the reader with preliminary notions such as machine models and complexity classes …