Resolution for quantified Boolean formulas
Information and Computation
An algorithm to evaluate quantified Boolean formulae
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Propositional Logic: Deduction and Algorithms
Propositional Logic: Deduction and Algorithms
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Quantifier structure in search based procedures for QBFs
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Variable Dependencies of Quantified CSPs
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Backdoor Sets of Quantified Boolean Formulas
Journal of Automated Reasoning
Boolean Propagation Based on Literals for Quantified Boolean Formulae
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
A Compact Representation for Syntactic Dependencies in QBFs
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Solving QBF with combined conjunctive and disjunctive normal form
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers
Electronic Notes in Theoretical Computer Science (ENTCS)
Evaluating and certifying QBFs: A comparison of state-of-the-art tools
AI Communications
Hard QBF Encodings Made Easy: Dream or Reality?
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Dynamically partitioning for solving QBF
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Backdoor sets of quantified boolean formulas
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Bounded universal expansion for preprocessing QBF
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Nenofex: expanding NNF for QBF solving
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Exploiting structure in an AIG based QBF solver
Proceedings of the Conference on Design, Automation and Test in Europe
An Empirical Study of QBF Encodings: from Treewidth Estimation to Useful Preprocessing
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
ATVA'11 Proceedings of the 9th international conference on Automated technology for verification and analysis
Decomposition of multi-operator queries on semiring-based graphical models
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
sKizzo: a suite to evaluate and certify QBFs
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
Integrating dependency schemes in search-based QBF solvers
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Dependency quantified horn formulas: models and complexity
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Hi-index | 0.05 |
We present a method—called quantifier tree reconstruction—that allows to efficiently recover ex-post a portion of the internal structure of QBF instances which was hidden as a consequence of the cast to prenex normal form. Means to profit from a quantifier tree are presented for all the main families of QBF solvers. Experiments on QBFLIB instances are also reported.