The SAT solver CaDiCaL provides a rich feature set with a clean library interface. It has
been adopted by many users, is well documented and easy to extend due to its effective …

Proof logging provides an auditable way of guaranteeing that a solver has produced a
correct answer using sound reasoning. This is standard practice for Boolean satisfiability …

Building on the progress in Boolean satisfiability (SAT) solving over the last decades,
maximum satisfiability (MaxSAT) has become a viable approach for solving NP-hard …

Proof logging in constraint programming is an approach to certifying a conclusion reached
by a solver. To allow for this, different propagators must be augmented to produce …

Pseudo-Boolean proof logging has been used successfully to provide certificates of
optimality from a variety of constraint-and satisifability-style solvers that combine reasoning …

Clausal proofs, particularly those based on the deletion resolution asymmetric tautology
(DRAT) proof system, are widely used by Boolean satisfiability solvers for expressing proofs …

There are clear benefits to incorporating mathematical databases and software into a proof
assistant. On the one hand, the assistant gains access to mathematical facts that require …

Combinatorial problems have a wide range of applications, including operations research,
chip design and many scheduling problems. Therefore, it is vital that the algorithms used to …

This is the documentation for the pseudo-Boolean proof checker V PB together with its
formally verified backend C PB as proposed for usage in the SAT competition 2023. If any …

Building on the progress in Boolean satisfiability (SAT) solving over the last decades,
maximum satisfiability (MaxSAT) has become a viable approach for solving NP-hard …