QBF Resolution Systems and Their Proof Complexities

@inproceedings{Balabanov2014QBFRS,
  title={QBF Resolution Systems and Their Proof Complexities},
  author={Valeriy Balabanov and Magdalena Widl and Jie-Hong Roland Jiang},
  booktitle={SAT},
  year={2014}
}
Quantified Boolean formula (QBF) evaluation has a broad range of applications in computer science and is gaining increasing attention. Recent progress has shown that for a certain family of formulas, Qresolution, which forms the foundation of learning in modern search-based QBF solvers, is exponentially inferior in proof size to two of its extensions: Q-resolution with resolution over universal literals (QU-resolution) and long-distance Q-resolution (LQ-resolution). The relative proof power… CONTINUE READING
Highly Cited
This paper has 63 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

64 Citations

0102020142015201620172018
Citations per Year
Semantic Scholar estimates that this publication has 64 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…