Compressing Propositional Refutations
Hasan Amjad · Electronic Notes in Theoretical Computer Science · 2007
We report initial results on shortening propositional resolution refutation proofs. This has an application in speeding up deductive reconstruction (in theorem provers) of large propositional refutations, such as those produced by SAT-solvers.