1. A linear-time algorithm for testing the truth of certain quantified Boolean formulas;Aspvall;Information Processing Letters,1979
2. A. Biere, Resolve and expand, in: Proceedings of the 7th International Conference on Theory and Applications of Satisfiability Testing (SAT’04), Revised Selected Papers, Lecture Notes on Computer Science, vol. 3542, Springer, Berlin, 2005, pp. 59–70.
3. U. Bubeck, H. Kleine Büning, Bounded universal expansion for preprocessing QBF, in: Proceedings of the 10th International Conference on Theory and Applications of Satisfiability Testing (SAT’07), Lecture Notes on Computer Science, vol. 4501, Springer, Berlin, 2007, pp. 244–257.
4. M. Cadoli, A. Giovanardi, M. Schaerf, An algorithm to evaluate quantified Boolean formulae, in: Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98), 1998, pp. 262–267.
5. S. Coste-Marquis, D. Le Berre, F. Letombe, A branching heuristics for quantified renamable Horn formulas, in: Proceedings of the 8th International Conference on Theory and Applications of Satisfiability Testing (SAT’05), Lecture Notes on Computer Science, vol. 3569, Springer, Berlin, 2005, pp. 393–399.