Strong (D)QBF Dependency Schemes via Pure Paths with Applications to Proof Checking

Abstract

Full Citation:

Leroy Chew, Tomás Peitl. Strong (D)QBF Dependency Schemes via Pure Paths with Applications to Proof Checking. 29th International Conference on Theory and Applications of Satisfiability Testing, SAT 2026, Lisbon, Portugal, July 20-23, 2026 (Alexey Ignatiev, Stefan Szeider, eds.), volume 377 of LIPIcs, pages 11:1–11:20, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Tomas Peitl
Tomas Peitl

Tomáš Peitl is a Project Assistant at the Algorithms and Complexity Group.