Compression algorithms[edit]
Algorithms for compression of sequent calculus proofs include cut introduction and cut elimination.
Algorithms for compression of propositional resolution proofs include
RecycleUnits,[2]
RecyclePivots,[2]
RecyclePivotsWithIntersection,[1]
LowerUnits,[1]
LowerUnivalents,[3]
Split,[4]
Reduce&Reconstruct,[5] and Subsumption.