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

Olaf Beyersdorff, Joshua Blinkhorn, Tomas Peitl
January 2020
PDF bib

Abstract

Full Citation:

Olaf Beyersdorff, Joshua Blinkhorn, Tomáš Peitl. Strong (D)QBF Dependency Schemes via Tautology-free Resolution Paths. Proceedings of SAT 2020, The 23rd International Conference on Theory and Applications of Satisfiability Testing (Luca Pulina, Martina Seidl, eds.), volume 12178 of Lecture Notes in Computer Science, pages 394–411, 2020, Springer Verlag.

Type
Conference Paper
Tomas Peitl
Tomas Peitl

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