Davis and Putnam Meet Henkin: Solving DQBF with Resolution

Blinkhorn, Joshua; Peitl, Tomáš; Slivovsky, Friedrich

doi:10.1007/978-3-030-80223-3_4

by Joshua Blinkhorn, Tomáš Peitl, Friedrich Slivovsky

Reference:

Davis and Putnam Meet Henkin: Solving DQBF with ResolutionJoshua Blinkhorn, Tomáš Peitl, Friedrich SlivovskyTheory and Applications of Satisfiability Testing - SAT 2021 - 24th International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings (Chu-Min Li, Felip Manyà, eds.), volume 12831 of Lecture Notes in Computer Science, pages 30–46, 2021, Springer Verlag.

Bibtex Entry:

@string{springer="Springer Verlag"}
@inproceedings{BlinkhornPS21,
  author    = {Joshua Blinkhorn and
               Tom{\'{a}}\v{s} Peitl and
               Friedrich Slivovsky},
  editor    = {Chu{-}Min Li and
               Felip Many{\`{a}}},
  title     = {Davis and Putnam Meet Henkin: Solving {DQBF} with Resolution},
  booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2021 - 24th
               International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {12831},
  pages     = {30--46},
  publisher = {Springer},
  year      = {2021},
  url       = {10.1007/978-3-030-80223-3_4">https://doi.org/10.1007/978-3-030-80223-3_4},
  doi       = {10.1007/978-3-030-80223-3\_4},
  keywords  = {l2solve}
}