Pulina, Luca and Tacchella, Armando (2008) Treewidth: a useful marker of empirical hardness in quantified Boolean logic encodings. In: LPAR 2008: Logic for Programming, Artificial Intelligence, and Reasoning: 15th International Conference: proceedings, 22-27 November 2008, Doha, Qatar. Berlin / Heidelberg, Springer. p. 528-542. (Lecture Notes in Computer Science, 5330/2008). ISSN 0302-9743. Conference or Workshop Item.
Full text not available from this repository.
Theoretical studies show that in some combinatorial problems, there is a close relationship between classes of tractable instances and the treewidth (tw) of graphs describing their structure. In the case of satisfiability for quantified Boolean formulas (QBFs), tractable classes can be related to a generalization of treewidth, that we call quantified treewidth (tw p). In this paper we investigate the practical relevance of computing tw p) for problem domains encoded as QBFs. We show that an approximation of tw p is a predictor of empirical hardness, and that it is the only parameter among several other candidates which succeeds consistently in being so. We also provide evidence that QBF solvers benefit from a preprocessing phase geared towards reducing tw p, and that such phase is a potential enabler for the solution of hard QBF encodings.
I documenti depositati in UnissResearch sono protetti dalle leggi che regolano il diritto d'autore
Repository Staff Only: item control page