Unified QBF certification and its applications

@article{Balabanov2012UnifiedQC,
  title={Unified QBF certification and its applications},
  author={Valeriy Balabanov and Jie-Hong Roland Jiang},
  journal={Formal Methods in System Design},
  year={2012},
  volume={41},
  pages={45-65}
}
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. To date the certificate of a true formula can be in the form of either a syntactic cube-resolution proof or a semantic Skolem-function model whereas that of a false formula is only in the form of a syntactic clause… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 78 CITATIONS, ESTIMATED 90% COVERAGE

Long-Distance Q-Resolution with Dependency Schemes

  • Journal of Automated Reasoning
  • 2018
VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Dependency Learning for QBF

VIEW 19 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Dependency Schemes in QBF Calculi: Semantics and Soundness

VIEW 11 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

On Q-Resolution and CDCL QBF Solving

  • Electronic Colloquium on Computational Complexity
  • 2016
VIEW 10 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Soundness of Q-resolution with dependency schemes

  • Theor. Comput. Sci.
  • 2016
VIEW 6 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2013
2019

CITATION STATISTICS

  • 20 Highly Influenced Citations

  • Averaged 10 Citations per year from 2017 through 2019

References

Publications referenced by this paper.
SHOWING 1-10 OF 21 REFERENCES

Clause-Term Resolution and Learning in Quantified Boolean Logic Satisfiability

E. Giunchiglia, M. Narizzano, A. Tacchella
  • Artificial Intelligence Research, 26:371-416,
  • 2006
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Interpolating functions from large Boolean relations

  • 2009 IEEE/ACM International Conference on Computer-Aided Design - Digest of Technical Papers
  • 2009
VIEW 1 EXCERPT

Automatic Hardware Synthesis from Specifications: A Case Study

  • 2007 Design, Automation & Test in Europe Conference & Exhibition
  • 2007
VIEW 2 EXCERPTS

R

A. Solar-Lezama, L. Tancau
  • Bod́ık, S. Seshia, and V. Saraswat. Combinatorial Sketching for Finite Programs. In Proc. Int’l Conf. on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pp. 404-415,
  • 2006
VIEW 1 EXCERPT