Clausal Proof Compression

6 pages•Published: September 27, 2016

Abstract

Although clausal propositional proofs are significantly smaller compared
to resolution proofs, their size is still too large for several
applications. In this paper we present several methods to compress
clausal proofs. These methods are based on a two phase approach. The
first phase consists of a light-weight compression algorithm that can
easily be added to satisfiability solvers that support the emission
of clausal proofs. In the second phase, we propose to use a powerful
off-the-shelf general-purpose compression tool, such as bzip2 and
7z. Sorting literals before compression facilitates a delta encoding,
which combined with variable-byte encoding improves the quality of the
compression. We show that clausal proofs can be compressed by one order
of magnitude by applying both phases.

Keyphrases: compression, proof, sat

In: Boris Konev, Stephan Schulz and Laurent Simon (editors). IWIL-2015. 11th International Workshop on the Implementation of Logics, vol 40, pages 21-26.

Links:	https://easychair.org/publications/paper/fgBF
	https://doi.org/10.29007/sgpl