Resolution for quantified Boolean formulas
Information and Computation
Variable and term removal from Boolean formulae
Discrete Applied Mathematics
Propositional Logic: Deduction and Algorithms
Propositional Logic: Deduction and Algorithms
QUBOS: Deciding Quantified Boolean Logic Using Propositional Satisfiability Solvers
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
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
Solving #SAT using vertex covers
Acta Informatica
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
Matched formulas and backdoor sets
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
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
Improved parameterized upper bounds for vertex cover
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
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
Kernelization algorithms for d-hitting set problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Parameterized Complexity
A Compact Representation for Syntactic Dependencies in QBFs
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Efficiently Representing Existential Dependency Sets for Expansion-based QBF Solvers
Electronic Notes in Theoretical Computer Science (ENTCS)
Variable independence and resolution paths for quantified boolean formulas
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Integrating dependency schemes in search-based QBF solvers
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Augmenting tractable fragments of abstract argumentation
Artificial Intelligence
Backdoors to tractable answer-set programming
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Augmenting tractable fragments of abstract argumentation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
The Multivariate Algorithmic Revolution and Beyond
Computing resolution-path dependencies in linear time ,
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Recovering and utilizing partial duality in QBF
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Efficient clause learning for quantified boolean formulas via QBF pseudo unit propagation
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.02 |
We generalize the notion of backdoor sets from propositional formulas to quantified Boolean formulas (QBF). This allows us to obtain hierarchies of tractable classes of quantified Boolean formulas with the classes of quantified Horn and quantified 2CNF formulas, respectively, at their first level, thus gradually generalizing these two important tractable classes. In contrast to known tractable classes based on bounded treewidth, the number of quantifier alternations of our classes is unbounded. As a side product of our considerations we develop a theory of variable dependency which is of independent interest.