Submitter: Luca Pulina
Description: Devised by L. Pulina and A. Tacchella, it is a QBF solver that implements a dynamic combination of search with solution- and conflict-backjumping and variable-elimination. The key point in this approach is to implicitly leverage graph abstractions of QBFs to yield structural features which support an effective decision between search and variable elimination.
Details are available in
Pulina, L., Tacchella, A.: A structural approach to reasoning with quantified Boolean formulas. In: 21st International Joint Conference on Artificial Intelligence (IJCAI 2009). (2009) 596602