Hard QBF encodings made easy: dream or reality?

Pulina, Luca and Tacchella, Armando (2009) Hard QBF encodings made easy: dream or reality? In: AI*IA 2009: Emergent Perspectives in Artificial Intelligence, 11. International Conference of the Italian Association for Artificial Intelligence, 9-12 December 2009, Reggio Emilia, Italy. Berlin - Heidelberg, Springer. p. 31-41. (Lecture Notes in Computer Science, 5883/2009). ISBN 978-3-642-10290-5. Conference or Workshop Item.

Full text not available from this repository.

DOI: 10.1007/978-3-642-10291-2_4

Abstract

In a recent work we have shown that quantified treewidth is an effective empirical hardness marker for quantified Boolean formulas (QBFs), and that a preprocessor geared towards decreasing quantified treewidth is a potential enabler for the solution of hard QBF encodings. In this paper we improve on previously introduced preprocessing techniques, and we broaden our experimental analysis to consider other structural parameters and other state-of-the-art preprocessors for QBFs. Our aim is to understand – in light of the parameters that we consider – whether manipulating a formula can make it easier, and under which conditions this is more likely to happen.

Item Type:	Conference or Workshop Item (Contribute)
ID Code:	7222
Status:	Published
Uncontrolled Keywords:	Quantified Boolean formulas (QBFs), quantified treewidth, preprocessors
Subjects:	Area 09 - Ingegneria industriale e dell'informazione > ING-INF/05 Sistemi di elaborazione delle informazioni
Divisions:	001 Università di Sassari > 01 Dipartimenti > Economia, istituzioni e società
Publisher:	Springer
ISBN:	978-3-642-10290-5
Deposited On:	15 Mar 2012 09:06

I documenti depositati in UnissResearch sono protetti dalle leggi che regolano il diritto d'autore

Repository Staff Only: item control page