Bridging the gap between dual propagation and CNF-based QBF solving
暂无分享,去创建一个
[1] David A. Plaisted,et al. A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..
[2] Armin Biere,et al. DepQBF: A Dependency-Aware QBF Solver , 2010, J. Satisf. Boolean Model. Comput..
[3] Edmund M. Clarke,et al. A Non-prenex, Non-clausal QBF Solver with Game-State Learning , 2010, SAT.
[4] Stefan Woltran,et al. A solver for QBFs in negation normal form , 2009, Constraints.
[5] Bart Selman,et al. QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency , 2006, SAT.
[6] Marco Benedetti,et al. A performance-driven QBF-based iterative logic array representation with applications to verification, debug and test , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.
[7] Armin Biere,et al. Resolve and Expand , 2004, SAT.
[8] Armando Tacchella,et al. QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability , 2001, IJCAR.
[9] Fahiem Bacchus,et al. Exploiting QBF Duality on a Circuit Representation , 2010, AAAI.
[10] Bart Selman,et al. The Achilles' Heel of QBF , 2005, AAAI.
[11] Marco Benedetti,et al. QBF-Based Formal Verification: Experience and Perspectives , 2008, J. Satisf. Boolean Model. Comput..
[12] Armin Biere,et al. Blocked Clause Elimination for QBF , 2011, CADE.
[13] Lintao Zhang,et al. Solving QBF with combined conjunctive and disjunctive normal form , 2006, AAAI 2006.