| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 422332 | Electronic Notes in Theoretical Computer Science | 2007 | 13 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
