@inproceedings{ChewPeitl26,
 author = {Leroy Chew and
Tomás Peitl},
 bibsource = {dblp computer science bibliography, https://dblp.org},
 biburl = {https://dblp.org/rec/conf/sat/ChewP26.bib},
 booktitle = {29th International Conference on Theory and Applications of Satisfiability
Testing, {SAT} 2026, Lisbon, Portugal, July 20-23, 2026},
 doi = {10.4230/LIPICS.SAT.2026.11},
 editor = {Alexey Ignatiev and
Stefan Szeider},
 pages = {11:1–11:20},
 publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{ü}r Informatik},
 series = {LIPIcs},
 timestamp = {Fri, 24 Jul 2026 12:03:13 +0200},
 title = {Strong {(D)QBF} Dependency Schemes via Pure Paths with Applications
to Proof Checking},
 url = {https://doi.org/10.4230/LIPIcs.SAT.2026.11},
 volume = {377},
 year = {2026}
}