Clauses Versus Gates in CEGAR-Based 2QBF Solving
暂无分享,去创建一个
[1] Jean-Marie Lagniez,et al. Preprocessing for Propositional Model Counting , 2014, AAAI.
[2] Karem A. Sakallah,et al. Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution , 2003, SAT.
[3] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[4] Mikolás Janota,et al. Solving QBF by Clause Selection , 2015, IJCAI.
[5] Fahiem Bacchus,et al. Recovering and Utilizing Partial Duality in QBF , 2013, SAT.
[6] David A. Plaisted,et al. A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..
[7] Christoph Scholl,et al. Exploiting structure in an AIG based QBF solver , 2009, 2009 Design, Automation & Test in Europe Conference & Exhibition.
[8] Armando Tacchella,et al. Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas , 2006, J. Artif. Intell. Res..
[9] Pierre Marquis,et al. On propositional definability , 2008, Artif. Intell..
[10] Klaus Truemper,et al. An Effective Algorithm for the Futile Questioning Problem , 2005, Journal of Automated Reasoning.
[11] Robert K. Brayton,et al. Technology Mapping into General Programmable Cells , 2015, FPGA.
[12] Lakhdar Sais,et al. Recovering and Exploiting Structural Knowledge from CNF Formulas , 2002, CP.
[13] Armin Biere,et al. Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.
[14] Lakhdar Sais,et al. Automatic Extraction of Functional Dependencies , 2004, SAT.
[15] Armin Biere,et al. DepQBF: A Dependency-Aware QBF Solver , 2010, J. Satisf. Boolean Model. Comput..
[16] Mikolás Janota,et al. Solving QBF with Counterexample Guided Refinement , 2012, SAT.
[17] G. S. Tseitin. On the Complexity of Derivation in Propositional Calculus , 1983 .
[18] Joao Marques-Silva,et al. Boolean satisfiability in electronic design automation , 2000, Proceedings 37th Design Automation Conference.