The last decade witnessed an ever-increasing stream of successes in Machine Learning
(ML). These successes offer clear evidence that ML is bound to become pervasive in a wide …

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 …

Symmetry and dominance breaking can be crucial for solving hard combinatorial search and
optimisation problems, but the correctness of these techniques sometimes relies on subtle …

In the last couple of decades, developments in SAT-based optimization have led to highly
efficient maximum satisfiability (MaxSAT) solvers, but in contrast to the SAT solvers on which …

Symmetry and dominance breaking can be crucial for solving hard combinatorial search and
optimisation problems, but the correctness of these techniques sometimes relies on subtle …

Abstract The Glasgow Subgraph Solver provides an implementation of state of the art
algorithms for subgraph isomorphism problems. It combines constraint programming …

We describe the design and implementation of a new constraint programming solver that
can produce an auditable record of what problem was solved and how the solution was …

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 …

The dramatic improvements in Boolean satisfiability (SAT) solving since the turn of the
millennium have made it possible to leverage state-of-the-art conflict-driven clause learning …

While certification has been successful in the context of satisfiablity solving, with most state-
of-the-art solvers now able to provide proofs of unsatisfiability, in maximum satisfiability …