Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths

Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl. Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths. In Luca Pulina, Martina Seidl, editors, Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings. Volume 12178 of Lecture Notes in Computer Science, pages 394-411, Springer, 2020. [doi]

Authors

Olaf Beyersdorff

This author has not been identified. Look up 'Olaf Beyersdorff' in Google

Joshua Blinkhorn

This author has not been identified. Look up 'Joshua Blinkhorn' in Google

Tomás Peitl

This author has not been identified. Look up 'Tomás Peitl' in Google