Resolution for quantified Boolean formulas
Information and Computation
Propositional Logic: Deduction and Algorithms
Propositional Logic: Deduction and Algorithms
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Hidden Structure in Unsatisfiable Random 3-SAT: An Empirical Study
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Generalizations of Matched CNF Formulas
Annals of Mathematics and Artificial Intelligence
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Fixed-Parameter Hierarchies inside PSPACE
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Backdoor Sets for DLL Subsolvers
Journal of Automated Reasoning
The backdoor key: a path to understanding problem hardness
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Backbones and backdoors in satisfiability
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Constructing conditional plans by a theorem-prover
Journal of Artificial Intelligence Research
Backdoors to typical case complexity
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Binary clause reasoning in QBF
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
QBF modeling: exploiting player symmetry for simplicity and efficiency
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Solving #SAT using vertex covers
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Parameterized Complexity
Variable Dependencies of Quantified CSPs
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
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Nenofex: expanding NNF for QBF solving
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Rewriting (dependency-)quantified 2-CNF with arbitrary free literals into existential 2-HORN
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
We generalize the notion of backdoor sets from propositional formulas to quantified Boolean formulas in conjunctive normal form (QCNF). We develop parameterized algorithms that admit uniform polynomial time QCNF evaluation parameterized by the size of smallest strong backdoor sets. For our algorithms we develop a theory of variable dependency which is of independent interest. As a result, we obtain hierarchies of classes of tractable QCNF formulas with the classes of quantified Horn and quantified 2CNF formulas, respectively, at their first level, thus gradually generalizing these two prominent tractable classes. In contrast to known tractable classes based on bounded treewidth, the number of quantifier alternations of our classes is unbounded.