论文信息 - Solving QBF by Combining Conjunctive and Disjunctive Normal Forms - 字舞流文

Solving QBF by Combining Conjunctive and Disjunctive Normal Forms

Lintao Zhang | Lintao Zhang

[1] Bart Selman,et al. The Achilles' Heel of QBF , 2005, AAAI.

[2] Marco Benedetti,et al. Quantifier Trees for QBFs , 2005, SAT.

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

[4] Moshe Y. Vardi,et al. Symbolic Decision Procedures for QBF , 2004, CP.

[5] Armin Biere,et al. Resolve and Expand , 2004, SAT.

[6] Klaus Truemper,et al. An Effective QBF Solver for Planning Problems , 2004, MSV/AMCS.

[7] Sharad Malik,et al. Conflict driven learning in a quantified Boolean Satisfiability solver , 2002, ICCAD 2002.

[8] Armando Tacchella,et al. Learning for quantified boolean logic satisfiability , 2002, AAAI/IAAI.

[9] Sharad Malik,et al. Towards a symmetric treatment of satisfaction and conflicts in QBF , 2002 .

[10] Bernd Becker,et al. Checking equivalence for partial implementations , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[11] Jussi Rintanen,et al. Constructing Conditional Plans by a Theorem-Prover , 1999, J. Artif. Intell. Res..

[12] Marco Schaerf,et al. An Algorithm to Evaluate Quantified Boolean Formulae , 1998, AAAI/IAAI.

[13] G. S. Tseitin. On the Complexity of Derivation in Propositional Calculus , 1983 .