Resolution Proofs and Skolem Functions in QBF Evaluation and Applications

@inproceedings{Balabanov2011ResolutionPA,
  title={Resolution Proofs and Skolem Functions in QBF Evaluation and Applications},
  author={Valeriy Balabanov and Jie-Hong Roland Jiang},
  booktitle={CAV},
  year={2011}
}
Quantified Boolean formulae (QBF) allow compact encoding of many decision problems. Their importance motivated the development of fast QBF solvers. Certifying the results of a QBF solver not only ensures correctness, but also enables certain synthesis and verification tasks particularly when the certificate is given as a set of Skolem functions. To date the certificate of a true formula can be in the form of either a (cube) resolution proof or a Skolem-function model whereas that of a false… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 16 CITATIONS

Flexibility and Optimization of QBF Skolem–Herbrand Certificates

  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 2016
VIEW 23 EXCERPTS
CITES BACKGROUND & METHODS

Software Workarounds for Hardware Errors: Instruction Patch Synthesis

  • IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
  • 2013
VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND

Functional Synthesis via Input-Output Separation

  • 2018 Formal Methods in Computer Aided Design (FMCAD)
  • 2018
VIEW 1 EXCERPT
CITES BACKGROUND

Solution Validation and Extraction for QBF Preprocessing

  • Journal of Automated Reasoning
  • 2016
VIEW 1 EXCERPT
CITES BACKGROUND

Property-directed synthesis of reactive systems from safety specifications

  • 2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)
  • 2015
VIEW 2 EXCERPTS
CITES METHODS