Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings

Luca Pulina, Armando Tacchella. Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings. In Iliano Cervesato, Helmut Veith, Andrei Voronkov, editors, Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings. Volume 5330 of Lecture Notes in Computer Science, pages 528-542, Springer, 2008. [doi]

Abstract

Abstract is missing.