Abstract
Some SAT-solvers are equipped with the ability to produce resolution proofs for problems which are unsatisfiable. Such proofs are used in a variety of contexts, including finding minimal unsatisfiable sets of clauses, interpolant generation, configuration management, and proof replay in interactive theorem provers. In all of these settings, the size of the proof may be prohibitively large for subsequent processing. We suggest some new methods for resolution proof minimization. First, we identify a simple and effective method of extracting shared structure from a proof using structural hashing. Second, we suggest a heuristically-guided proof rewriting technique based on variable valuations. Our findings indicate structural sharing reduces proof length significantly and efficiently, and that our valuation-based rewriting method can give substantial further reductions but is currently limited to smaller proofs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amjad, H.: Compressing propositional refutations. Electron. Notes Theor. Comput. Sci. 185, 3–15 (2007)
Amjad, H.: Data compression for proof replay. J. of Automated Reasoning (December 2008)
Bar-Ilan, O., Fuhrmann, O., Hoory, S., Shacham, O., Strichman, O.: Linear-time reductions of resolution proofs. In: HVC, pp. 114–128 (2008)
Beame, P., Kautz, H., Sabharwal, A.: Understanding the Power of Clause Learning. J. of Artificial Intelligence Research (2004)
Ben-sasson, E., Wigderson, A.: Short proofs are narrow - resolution made simple. J. of the ACM, 517–526 (2001)
Biere, A.: tracecheck, http://fmv.jku.at/booleforce/index.html
Biere, A.: Picosat essentials. J. on Satisfiability, Boolean Modeling, and Computation, 75–97 (2008)
Blake, A.: Canonical Expressions in Boolean Algebra. PhD thesis, University of Chicago (1937)
Cotton, S.: On Some Problems in Satisfiability Solving. PhD thesis, University Joseph Fourier, Grenoble I (2009)
Eén, N., Sörensson, N.: MiniSat: A SAT Solver with Conflict-clause Minimization. In: Theory and Applications of Satisfiability Testing, SAT (2005)
Ganai, M.K., Kuehlmann, A.: On-the-fly compression of logical circuits. In: International Workshop on Logic Synthesis (2000)
Van Gelder, A.: Verifying propositional unsatisfiability: Pitfalls to avoid. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 328–333. Springer, Heidelberg (2007)
Van Gelder, A.: Improved conflict-clause minimization leads to improved propositional proof traces. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 141–146. Springer, Heidelberg (2009)
Goldberg, E., Novikov, Y.: Verification of proofs of unsatisfiability for cnf formulas. In: Design, Automation and Test in Europe, DATE (2003)
Küchlin, W., Sinz, C.: Proving consistency assertions for automotive product data management. J. Automated Reasoning 24(1-2) (February 2000)
Lynce, I., Marques-Silva, J.: On computing minimum unsatisfiable cores. In: Theory and Applications of Satisfiability Testing, SAT (2004)
McMillan, K., Amla, N.: Automatic abstraction without counterexamples. Tools and Algorithms for the Construction and Analysis of Systems, 2–17 (2003)
McMillan, K.L.: Interpolation and SAT-Based Model Checking. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 1–13. Springer, Heidelberg (2003)
Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: DAC (2001)
Sinz, C.: Compressing propositional proofs by common subproof extraction. In: Moreno Díaz, R., Pichler, F., Quesada Arencibia, A. (eds.) EUROCAST 2007. LNCS, vol. 4739, pp. 547–555. Springer, Heidelberg (2007)
Sinz, C., Kaiser, A., Küchlin, W.: Formal methods for the validation of automotive product configuration data. Artif. Intell. Eng. Des. Anal. Manuf. 17 (2003)
Sörensson, N., Biere, A.: Minimizing learned clauses. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 237–243. Springer, Heidelberg (2009)
Zhang, L., Malik, S.: Extracting small unsatisfiable cores from unsatisfiable boolean formulas. In: Theory and Applications of Satisfiability Testing, SAT (2003)
Zhang, L., Malik, S.: Validating sat solvers using an independent resolution-based checker: Practical implementations and other applications. In: Design, Automation and Test in Europe, DATE (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cotton, S. (2010). Two Techniques for Minimizing Resolution Proofs. In: Strichman, O., Szeider, S. (eds) Theory and Applications of Satisfiability Testing – SAT 2010. SAT 2010. Lecture Notes in Computer Science, vol 6175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14186-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-14186-7_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14185-0
Online ISBN: 978-3-642-14186-7
eBook Packages: Computer ScienceComputer Science (R0)