Pulina, Luca and Tacchella, Armando (2008) QuBIS: an (in)complete solver for quantified Boolean formulas. In: MICAI 2008: Advances in artificial intelligence: 7th Mexican International Conference on Artificial Intelligence, 27-31 October 2008, Atizapán de Zaragoza, Mexico. Berlin - Heidelberg, Springer. p. 34-43. (Lecture Notes in Computer Science, 5317/2008). ISSN 0302-9743. ISBN 978-3-540-88635-8. Conference or Workshop Item.
Full text not available from this repository.
In this paper we introduce QuBIS an (in)complete solver for quantified Boolean formulas (QBFs). The particularity of QuBIS is 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, QuBIS outputs a partial result which can be fed to a complete QBF solver for further processing. As our experiments show, not only QuBIS is competitive as an incomplete solver, but providing the output of QuBIS as an input to complete solvers can boost their performances on several instances.
I documenti depositati in UnissResearch sono protetti dalle leggi che regolano il diritto d'autore
Repository Staff Only: item control page