@InProceedings{chew_et_al:LIPIcs.STACS.2022.22,
author = {Chew, Leroy and Slivovsky, Friedrich},
title = {{Towards Uniform Certification in QBF}},
booktitle = {39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)},
pages = {22:1--22:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-222-8},
ISSN = {1868-8969},
year = {2022},
volume = {219},
editor = {Berenbrink, Petra and Monmege, Benjamin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2022.22},
URN = {urn:nbn:de:0030-drops-158326},
doi = {10.4230/LIPIcs.STACS.2022.22},
annote = {Keywords: QBF, Proof Complexity, Verification, Frege, Extended Frege, Strategy Extraction}
}