论文信息 - Compressing Propositional Refutations

Compressing Propositional Refutations

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.

Hasan Amjad

[1] Armin Biere,et al. Symbolic Model Checking without BDDs , 1999, TACAS.

[2] Karl Crary,et al. Small Proof Witnesses for LF , 2005, ICLP.

[3] Karem A. Sakallah,et al. ZBDD-Based Backtrack Search SAT Solver , 2002, IWLS.

[4] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.

[5] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.

[6] Wolfgang Bibel,et al. On Matrices with Connections , 1981, JACM.

[7] M. Gordon,et al. Introduction to HOL: a theorem proving environment for higher order logic , 1993 .

[8] Peter B. Andrews. Refutations by Matings , 1976, IEEE Transactions on Computers.

[9] Robert A. Kowalski,et al. A Proof Procedure Using Connection Graphs , 1975, JACM.

[10] Sharad Malik,et al. Validating SAT solvers using an independent resolution-based checker: practical implementations and other applications , 2003, 2003 Design, Automation and Test in Europe Conference and Exhibition.

[11] Tjark Weber,et al. Using a SAT Solver as a Fast Decision Procedure for Propositional Logic in an LCF-style Theorem Prover? , 2005 .

[12] Stephan Merz,et al. Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants , 2006, TACAS.

[13] Armin Biere,et al. Extended Resolution Proofs for Symbolic SAT Solving with Quantification , 2006, SAT.