2 QBF : Challenges and Solutions
暂无分享,去创建一个
[1] Karem A. Sakallah,et al. Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution , 2003, SAT.
[2] Christoph Scholl,et al. Exploiting structure in an AIG based QBF solver , 2009, 2009 Design, Automation & Test in Europe Conference & Exhibition.
[3] Mikolás Janota,et al. Solving QBF by Clause Selection , 2015, IJCAI.
[4] Armando Tacchella,et al. QuBE++: An Efficient QBF Solver , 2004, FMCAD.
[5] Armin Biere,et al. DepQBF: A Dependency-Aware QBF Solver (System Description) , 2010 .
[6] Marco Benedetti,et al. sKizzo: A Suite to Evaluate and Certify QBFs , 2005, CADE.
[7] Mikolás Janota,et al. Abstraction-Based Algorithm for 2QBF , 2011, SAT.
[8] Jie-Hong Roland Jiang,et al. Unified QBF certification and its applications , 2012, Formal Methods Syst. Des..
[9] Joao Marques-Silva,et al. Boolean satisfiability in electronic design automation , 2000, Proceedings 37th Design Automation Conference.
[10] Armando Tacchella,et al. Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas , 2006, J. Artif. Intell. Res..
[11] Armin Biere,et al. Blocked Clause Elimination for QBF , 2011, CADE.
[12] Klaus Truemper,et al. An Effective Algorithm for the Futile Questioning Problem , 2005, Journal of Automated Reasoning.
[13] Robert K. Brayton,et al. Technology Mapping into General Programmable Cells , 2015, FPGA.
[14] Ofer Strichman,et al. Faster Extraction of High-Level Minimal Unsatisfiable Cores , 2011, SAT.
[15] G. S. Tseitin. On the Complexity of Derivation in Propositional Calculus , 1983 .
[16] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[17] Mikolás Janota,et al. Solving QBF with Counterexample Guided Refinement , 2012, SAT.