A multi-engine solver for quantified boolean formulas

Authors:
Luca Pulina;Armando Tacchella
Affiliations:
DIST, Università di Genova, Genova, Italy;DIST, Università di Genova, Genova, Italy
Venue:
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Year:
2007

Citing 13
Cited 9

Instance-Based Learning Algorithms

Machine Learning
C4.5: programs for machine learning

C4.5: programs for machine learning
Resolution for quantified Boolean formulas

Information and Computation
A machine program for theorem-proving

Communications of the ACM
Algorithm portfolios

Artificial Intelligence - special issue on computational tradeoffs under bounded resources
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
Data Mining

Data Mining
The achilles' heel of QBF

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Learning to solve QBF

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
A study of cross-validation and bootstrap for accuracy estimation and model selection

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Resolve and expand

SAT'04 Proceedings of the 7th 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

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
A self-adaptive multi-engine solver for quantified Boolean formulas

Constraints
User-Friendly Model Checking: Automatically Configuring Algorithms with RuleBase/PE

HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Engineering portfolios of Machine Learning algorithms to solve complex tasks in Robotics and Automated Reasoning

AI Communications
A constraint satisfaction framework for executing perceptions and actions in diagrammatic reasoning

Journal of Artificial Intelligence Research
Non-model-based algorithm portfolios for SAT

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
A more efficient BDD-based QBF solver

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
An evaluation of machine learning in algorithm selection for search problems

AI Communications - The Symposium on Combinatorial Search

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the problem of yielding robust performances from current state-of-the-art solvers for quantified Boolean formulas (QBFs). Building on top of existing QBF solvers, we implement a new multi-engine solver which can inductively learn its solver selection strategy. Experimental results confirm that our solver is always more robust than each single engine, that it is stable with respect to various perturbations, and that such results can be partially explained by a handful of features playing a crucial role in our solver.