A Unified Proof System for QBF Preprocessing

  • Marijn J. H. Heule
  • Martina Seidl
  • Armin Biere
Conference paper

DOI: 10.1007/978-3-319-08587-6_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8562)
Cite this paper as:
Heule M.J.H., Seidl M., Biere A. (2014) A Unified Proof System for QBF Preprocessing. In: Demri S., Kapur D., Weidenbach C. (eds) Automated Reasoning. IJCAR 2014. Lecture Notes in Computer Science, vol 8562. Springer, Cham

Abstract

For quantified Boolean formulas (QBFs), preprocessing is essential to solve many real-world formulas. The application of a preprocessor, however, prevented the extraction of proofs for the original formula. Such proofs are required to independently validate correctness of the preprocessor’s rewritings and the solver’s result. Especially for universal expansion proof checking was not possible so far. In this paper, we introduce a unified proof system based on three simple and elegant quantified resolution asymmetric tautology (QRAT) rules. In combination with an extended version of universal reduction, they are sufficient to efficiently express all preprocessing techniques used in state-of-the-art preprocessors including universal expansion. Moreover, these rules give rise to new preprocessing techniques. We equip our preprocessor bloqqer with QRAT proof logging and provide a proof checker for QRAT proofs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Marijn J. H. Heule
    • 1
  • Martina Seidl
    • 2
  • Armin Biere
    • 2
  1. 1.Department of Computer ScienceThe University of Texas at AustinUSA
  2. 2.Institute for Formal Models and VerificationJKU LinzAustria

Personalised recommendations