Hard QBF Encodings Made Easy: Dream or Reality?

Authors:
Luca Pulina;Armando Tacchella
Affiliations:
DIST, Università di Genova, Genova, Italy 16145;DIST, Università di Genova, Genova, Italy 16145
Venue:
AI*IA '09: Proceedings of the XIth International Conference of the Italian Association for Artificial Intelligence Reggio Emilia on Emergent Perspectives in Artificial Intelligence
Year:
2009

Citing 12
Cited 0

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
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
The achilles' heel of QBF

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Clause/term resolution and learning in the evaluation of quantified Boolean formulas

Journal of Artificial Intelligence Research
Search in a small world

IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Bounded universal expansion for preprocessing QBF

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Preprocessing QBF

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Quantifier trees for QBFs

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
From pebble games to tractability: an ambidextrous consistency algorithm for quantified constraint satisfaction

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a recent work we have shown that quantified treewidth is an effective empirical hardness marker for quantified Boolean formulas (QBFs), and that a preprocessor geared towards decreasing quantified treewidth is a potential enabler for the solution of hard QBF encodings. In this paper we improve on previously introduced preprocessing techniques, and we broaden our experimental analysis to consider other structural parameters and other state-of-the-art preprocessors for QBFs. Our aim is to understand --- in light of the parameters that we consider --- whether manipulating a formula can make it easier, and under which conditions this is more likely to happen.