Learn More
Emerging applications demand to solve problems that are considered to be more difficult than NP-complete problems. Evaluating a quantified Boolean formula (QBF) is one of those problems. For the satisfiability problem (SAT), the NP-complete subclass of QBF, excellent solvers have been developed. However, research on subclasses of QBF at higher levels has(More)
  • 1