Compressing Propositional Refutations

Hasan Amjad (1)

1 Computer Laboratory [Cambridge]

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.

Mots clés: Proof verification; Propositional refutations

Domaines: Logique en informatique [cs.LO]

Hasan Amjad. Compressing Propositional Refutations. Automatic Verification of Critical Systems, Sep 2006, Nancy/France, pp.7-18. ⟨inria-00089495⟩