Resolution for quantified Boolean formulas
Information and Computation
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
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
SATISFIABILITY TESTING WITH MORE REASONING AND LESS GUESSING
SATISFIABILITY TESTING WITH MORE REASONING AND LESS GUESSING
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
Bounded universal expansion for preprocessing QBF
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
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
| Hi-index | 0.00 |
In this paper we introduce QuBISan (in)complete solver for quantified Boolean formulas (QBFs). The particularity of QuBISis that it is not inherently incomplete, but it has the ability to surrender upon realizing that its deduction mechanism is becoming ineffective. Whenever this happens, QuBISoutputs a partial result which can be fed to a complete QBF solver for further processing. As our experiments show, not only QuBISis competitive as an incomplete solver, but providing the output of QuBISas an input to complete solvers can boost their performances on several instances.