Login / Signup

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

Roderick BloemNicolas Braud-SantoniVedad HadzicUwe EglyFlorian LonsingMartina Seidl
Published in: Formal Methods Syst. Des. (2021)
Keyphrases
  • sat solvers
  • propositional satisfiability
  • sat instances
  • computational complexity
  • boolean formula
  • quantified boolean formulas
  • learning algorithm
  • special case
  • dynamic programming
  • sat problem
  • weighted max sat