Asano, T., Williamson, D.P.: Improved approximation algorithms for max sat. J. Algorithms 42(1), 173-202 (2002)
Benedetti, M.: Evaluating QBFs via Symbolic Skolemization. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol. 3452, pp. 285-300. Springer, Heidelberg (2005)
Benedetti,M.: Extracting Certificates from Quantified Boolean Formulas. In: Kaelbling, L.P., Saffiotti, A. (eds.) IJCAI, pp. 47-53. Professional Book Center (2005)
Benedetti, M.: Quantifier Trees for QBFs. In: Bacchus, F.,Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 378-385. Springer, Heidelberg (2005)
Benedetti, M.: sKizzo: A Suite to Evaluate and Certify QBFs. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 369-376. Springer, Heidelberg (2005)
Benedetti, M., Mangassarian, H.: Qbf-based formal verification: Experience and perspectives. JSAT 5(1-4), 133-191 (2008)
Cadoli, M., Giovanardi, A., Schaerf, M.: An algorithm to evaluate quantified Boolean formulae. In: Proc. of AAAI 1998/IAAI 1998, pp. 262-267. MIT Press, Cambridge (1998)
Cassez, F., David, A., Fleury, E., Larsen, K.G., Lime, D.: Efficient on-the-fly algorithms for the analysis of timed games. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 66-80. Springer, Heidelberg (2005) (Pubitemid 41520734)
Cook, B., Kroening, D., Sharygina, N.: Verification of boolean programs with unbounded thread creation. Theor. Comput. Sci. 388(1-3), 227-242 (2007)
De Wulf, M., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Antichains: A New Algorithm for Checking Universality of Finite Automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 17-30. Springer, Heidelberg (2006) (Pubitemid 44560862)
Doyen, L., Raskin, J.-F.: Antichain Algorithms for Finite Automata. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 2-22. Springer, Heidelberg (2010)
Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
Egly, U., Eiter, T., Tompits, H.,Woltran, S.: Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. In: Proc. of IAAI, pp. 417-422. AAAI Press, Menlo Park (2000)
Giunchiglia, E., Narizzano, M., Tacchella, A.: Quantified Boolean Formulas satisfiability library (QBFLIB) (2001), www.qbflib.org
Giunchiglia, E., Narizzano, M., Tacchella, A.: QuBE++: An Efficient QBF Solver. In: Hu, A.J.,Martin, A.K. (eds.) FMCAD 2004. LNCS, vol. 3312, pp. 201-213. Springer, Heidelberg (2004)
Giunchiglia, E., Narizzano, M., Tacchella, A.: Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas. J. Artif. Intell. Res. 26, 371-416 (2006)
Kohli, R., Krishnamurti, R., Mirchandani, P.: The Minimum Satisfiability Problem. SIAM J. Discrete Math. 7(2), 275-283 (1994)
Kügel, A.: Improved Exact Solver for the Weighted Max-SAT problem. Accepted at the workshop Pragmatics of SAT. To appear in easychair electronic proceedings (2011)
Li, C.M., Manyà, F.: MaxSAT, Hard and Soft Constraints. In: Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 613-631. IOS Press, Amsterdam (2009)
Lonsing, F., Biere, A.: DepQBF: A dependency-aware QBF solver (System Description). Journal on Satisfiability, Boolean Modeling and Computation 7, 71-76 (2010)
Lonsing, F., Biere, A.: Integrating Dependency Schemes in Search-Based QBF Solvers. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 158-171. Springer, Heidelberg (2010)
Narizzano, M., Peschiera, C., Pulina, L., Tacchella, A.: Evaluating and certifying QBFs: A comparison of state-of-the-art tools. AI Commun. 22, 191-210 (2009)
Pan, G., Vardi,M.Y.: Symbolic Decision Procedures for QBF. In:Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 453-467. Springer, Heidelberg (2004)
