Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > DEPENDENCY LEARNING:
Reports tagged with dependency learning:
TR25-149 | 10th October 2025
Leroy Chew, Tomáš Peitl

Strong (D)QBF Dependency Schemes via Pure Universal Resolution Paths

Certification for Quantified Boolean Formulas (QBF) and Dependency Quantified Boolean Formulas is an ongoing challenge (DQBF). Recent proof complexity work has shown that the majority of QBF and DQBF techniques can be p-simulated by using the independent extension rule. In propositional logic, extension rules are supported by proof checkers using ... more >>>




ISSN 1433-8092 | Imprint