Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Resolution for quantified Boolean formulas
Information and Computation
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
Conflict driven learning in a quantified Boolean Satisfiability solver
Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
A complete anytime algorithm for treewidth
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Fixed-Parameter Hierarchies inside PSPACE
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Data Mining
Clause/term resolution and learning in the evaluation of quantified Boolean formulas
Journal of Artificial Intelligence Research
Backtracking procedures for hypertree, hyperspread and connected hypertree decomposition of CSPs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The complexity of quantified constraint satisfaction problems under structural restrictions
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A multi-engine solver for quantified boolean formulas
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
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
sKizzo: a suite to evaluate and certify QBFs
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Quantifier Structure in Search-Based Procedures for QBFs
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
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
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
The seventh QBF solvers evaluation (QBFEVAL’10)
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Decomposing Quantified Conjunctive (or Disjunctive) Formulas
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Theoretical studies show that in some combinatorial problems, there is a close relationship between classes of tractable instances and the treewidth (tw ) of graphs describing their structure. In the case of satisfiability for quantified Boolean formulas (QBFs), tractable classes can be related to a generalization of treewidth, that we call quantified treewidth (tw p ). In this paper we investigate the practical relevance of computing tw p for problem domains encoded as QBFs. We show that an approximation of tw p is a predictor of empirical hardness, and that it is the only parameter among several other candidates which succeeds consistently in being so. We also provide evidence that QBF solvers benefit from a preprocessing phase geared towards reducing tw p , and that such phase is a potential enabler for the solution of hard QBF encodings.