Compressing Propositional Refutations
Résumé
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.
Domaines
Logique en informatique [cs.LO]
Loading...