A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Strong Extension-Free Proof Systems
2019
Journal of automated reasoning
We introduce proof systems for propositional logic that admit short proofs of hard formulas as well as the succinct expression of most techniques used by modern SAT solvers. Our proof systems allow the derivation of clauses that are not necessarily implied, but which are redundant in the sense that their addition preserves satisfiability. To guarantee that these added clauses are redundant, we consider various efficiently decidable redundancy criteria which we obtain by first characterizing
doi:10.1007/s10817-019-09516-0
pmid:32226181
pmcid:PMC7089731
fatcat:i6es4zm4hjfx5fwyeltxtigpdi