Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations

Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl. Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations. Formal Methods in System Design, 57(2):157-177, 2021. [doi]

@article{BloemBHELS21,
  title = {Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations},
  author = {Roderick Bloem and Nicolas Braud-Santoni and Vedad Hadzic and Uwe Egly and Florian Lonsing and Martina Seidl},
  year = {2021},
  doi = {10.1007/s10703-021-00371-7},
  url = {https://doi.org/10.1007/s10703-021-00371-7},
  researchr = {https://researchr.org/publication/BloemBHELS21},
  cites = {0},
  citedby = {0},
  journal = {Formal Methods in System Design},
  volume = {57},
  number = {2},
  pages = {157-177},
}