Twelve Years of QBF Evaluations: QSAT Is PSPACE-Hard and It Shows

[1]  Bernd Becker,et al.  Provably optimal test cube generation using quantified boolean formula solving , 2013, 2013 18th Asia and South Pacific Design Automation Conference (ASP-DAC).

[2]  Ian H. Witten,et al.  The WEKA data mining software: an update , 2009, SKDD.

[3]  Armin Biere,et al.  DepQBF: A Dependency-Aware QBF Solver (System Description) , 2010 .

[4]  Fahiem Bacchus,et al.  Binary Clause Reasoning in QBF , 2006, SAT.

[5]  Luca Pulina,et al.  Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings , 2008, LPAR.

[6]  Armin Biere,et al.  Failed Literal Detection for QBF , 2011, SAT.

[7]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

[8]  Luca Pulina,et al.  A self-adaptive multi-engine solver for quantified Boolean formulas , 2009, Constraints.

[9]  G. Celeux,et al.  A Classification EM algorithm for clustering and two stochastic versions , 1992 .

[10]  Armin Biere,et al.  Blocked Clause Elimination for QBF , 2011, CADE.

[11]  Christoph Scholl,et al.  An AIG-based QBF-solver using SAT for preprocessing , 2010, Design Automation Conference.

[12]  S. Shapiro,et al.  An Analysis of Variance Test for Normality (Complete Samples) , 1965 .

[13]  Inês Lynce,et al.  The Seventh QBF Solvers Evaluation (QBFEVAL'10) , 2010, SAT.

[14]  Luca Pulina,et al.  A Structural Approach to Reasoning with Quantified Boolean Formulas , 2009, IJCAI.

[15]  Armando Tacchella,et al.  Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas , 2006, J. Artif. Intell. Res..

[16]  Armando Tacchella,et al.  Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers , 2003, SAT.

[17]  Marco Benedetti,et al.  sKizzo: A Suite to Evaluate and Certify QBFs , 2005, CADE.

[18]  Lukasz Kaiser,et al.  Experiments with Reduction Finding , 2013, SAT.

[19]  Mikolás Janota,et al.  The QBFGallery 2014: The QBF Competition at the FLoC Olympic Games , 2014, J. Satisf. Boolean Model. Comput..

[20]  Enrico Giunchiglia,et al.  Partially Grounded Planning as Quantified Boolean Formula , 2013, ICAPS.

[21]  Florian Lonsing,et al.  The QBF Gallery: Behind the scenes , 2016, Artif. Intell..

[22]  Mikolás Janota,et al.  Solving QBF with Counterexample Guided Refinement , 2012, SAT.

[23]  Hans Kleine Büning,et al.  Bounded Universal Expansion for Preprocessing QBF , 2007, SAT.

[24]  Bernd Becker,et al.  Proving QBF-hardness in Bounded Model Checking for Incomplete Designs , 2013, 2013 14th International Workshop on Microprocessor Test and Verification.

[25]  Albert Oliveras,et al.  6 Years of SMT-COMP , 2012, Journal of Automated Reasoning.

[26]  Enrico Giunchiglia,et al.  sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning , 2010, SAT.

[27]  David A. Plaisted,et al.  A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..

[28]  Armin Biere,et al.  Clause Elimination for SAT and QSAT , 2015, J. Artif. Intell. Res..

[29]  Luca Pulina,et al.  Report of the Third QBF Solvers Evaluation , 2006, J. Satisf. Boolean Model. Comput..

[30]  Marco Benedetti,et al.  Evaluating QBFs via Symbolic Skolemization , 2005, LPAR.

[31]  Luca Pulina,et al.  An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing , 2010, Fundam. Informaticae.

[32]  Edmund M. Clarke,et al.  A Non-prenex, Non-clausal QBF Solver with Game-State Learning , 2010, SAT.