A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Post-verification debugging of hierarchical designs
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Dynamically partitioning for solving QBF
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Performance prediction and automated tuning of randomized and parametric algorithms
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Binary clause reasoning in QBF
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Cross-disciplinary perspectives on meta-learning for algorithm selection
ACM Computing Surveys (CSUR)
Instance-Based Selection of Policies for SAT Solvers
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
PaQuBE: Distributed QBF Solving with Advanced Knowledge Sharing
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
SATzilla: portfolio-based algorithm selection for SAT
Journal of Artificial Intelligence Research
A multi-engine solver for quantified boolean formulas
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Online estimation of SAT solving runtime
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Learning to integrate deduction and search in reasoning about quantified boolean formulas
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
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
Learning and using domain-specific heuristics in ASP solvers
AI Communications - Answer Set Programming
A portfolio solver for answer set programming: preliminary report
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Review: Measuring instance difficulty for combinatorial optimization problems
Computers and Operations Research
Evaluating component solver contributions to portfolio-based algorithm selectors
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Simple algorithm portfolio for SAT
Artificial Intelligence Review
| Hi-index | 0.00 |
We present a novel approach to solving Quantified Boolean Formulas (QBF) that combines a search-based QBF solver with marhine learning techniques. We show how classification methods can be used to predict run-times and to choose optimal heuristics both within a portfolio-based, and within a dynamic, online approach. In the dynamic method variables are set to a truth value according to a scheme that tries to maximize the probability of successfully solving the remaining sub-problem efficiently. Since each variable assignment can drastically change the problem-structure, new heuristics are chosen dynamically, and a classifier is used online to predict the usefulness of each heuristic. Experimental results on a large corpus of example problems show the usefulness of our approach in terms of run-time as well as the ability to solve previously unsolved problem instances.