sKizzo: A Suite to Evaluate and Certify QBFs
暂无分享,去创建一个
[1] David A. Basin,et al. Bounded Model Construction for Monadic Second-Order Logics , 2000, CAV.
[2] Armando Tacchella,et al. QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability , 2001, IJCAR.
[3] S. Malik,et al. Towards symmetric treatment of con?icts and satisfaction in quanti-fied Boolean satisfiability solv , 2002 .
[4] Reinhold Letz,et al. Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas , 2002, TABLEAUX.
[5] Sharad Malik,et al. Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation , 2002, CP.
[6] Armando Tacchella,et al. The Second QBF Solvers Comparative Evaluation , 2004, SAT (Selected Papers.
[7] Armin Biere,et al. Resolve and Expand , 2004, SAT.
[8] Marco Benedetti,et al. Evaluating QBFs via Symbolic Skolemization , 2005, LPAR.
[9] Marco Benedetti,et al. a QBF decision procedure based on Propositional Skolemization and Symbolic Reasoning , 2004 .
[10] Marco Benedetti. Extracting Certificates from Quantified Boolean Formulas , 2005, IJCAI.
[11] Marco Benedetti,et al. Quantifier Trees for QBFs , 2005, SAT.