Paper Info
Title
QuBIS: An (In)complete Solver for Quantified Boolean Formulas
Abstract
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.
Year
DOI
Venue
2008
10.1007/978-3-540-88636-5_3
MICAI
Keywords
Field
DocType
complete qbf solver,boolean formula,complete solver,quantified boolean formulas,partial result,deduction mechanism,incomplete solver
Surrender,Computer science,Arithmetic,Algorithm,Artificial intelligence,Solver,Machine learning
Conference
Volume
ISSN
Citations 
5317
0302-9743
0
PageRank 
References 
Authors
0.34
15
2
Name
Order
Citations
PageRank
Luca Pulina132637.95
Armando Tacchella21448108.82