On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width

Pascal Koiran, Klaus Meer. On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. In Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniƫl Paulusma, editors, Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers. Volume 5344 of Lecture Notes in Computer Science, pages 252-263, 2008. [doi]

Abstract

Abstract is missing.