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

Beyersdorff, Olaf; Blinkhorn, Joshua; Peitl, Tomáš

by Olaf Beyersdorff, Joshua Blinkhorn, Tomáš Peitl

Reference:

Strong (D)QBF Dependency Schemes via Tautology-free Resolution PathsOlaf Beyersdorff, Joshua Blinkhorn, Tomáš PeitlProceedings 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.

Bibtex Entry:

@string{lncs="Lecture Notes in Computer Science"}
@string{springer="Springer Verlag"}
@InProceedings{BeyersdorffBlinkhornPeitl20,
  author    = {Olaf Beyersdorff and
               Joshua Blinkhorn and
               Tom{\'{a}}{\v{s}} Peitl},
  title     = {Strong {(D)QBF} Dependency Schemes via Tautology-free Resolution Paths},
  booktitle = {Proceedings of SAT 2020, The 23rd International
                  Conference on Theory and Applications of
                  Satisfiability Testing},
  year      = {2020},
  editor    = {Luca Pulina and Martina Seidl},
  series    = LNCS,
  publisher = Springer,
 pages     = {394--411},
 volume    = {12178},
url       = {https://eccc.weizmann.ac.il/report/2020/036},
}