Revisiting Graph Width Measures for CNF-Encodings

We consider bounded width CNF-formulas where the width is measured by popular graph width measures on graphs associated to CNF-formulas. Such restricted graph classes, in particular those of bounded treewidth, have been extensively studied for their uses in the design of algorithms for various computational problems on CNF-formulas. Here we consider the expressivity of these formulas in the model of clausal encodings with auxiliary variables. We first show that bounding the width for many of the measures from the literature leads to a dramatic loss of expressivity, restricting the formulas to such of low communication complexity. We then show that the width of optimal encodings with respect to different measures is strongly linked: there are two classes of width measures, one containing primal treewidth and the other incidence cliquewidth, such that in each class the width of optimal encodings only differs by constant factors. Moreover, between the two classes the width differs at most by a factor logarithmic in the number of variables. Both these results are in stark contrast to the setting without auxiliary variables where all width measures we consider here differ by more than constant factors and in many cases even by linear factors.

[1]  Stefan Szeider,et al.  Strong Backdoors to Bounded Treewidth SAT , 2012, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[2]  Adnan Darwiche,et al.  A Lower Bound on the Size of Decomposable Negation Normal Form , 2010, AAAI.

[3]  Klaus Meer,et al.  On the expressive power of CNF formulas of bounded tree- and clique-width , 2011, Discret. Appl. Math..

[4]  Georg Schnitger,et al.  Triangle-Freeness Is Hard To Detect , 2002, Comb. Probab. Comput..

[5]  Ingo Wegener,et al.  Branching Programs and Binary Decision Diagrams , 1987 .

[6]  Matthias Krause,et al.  Exponential Lower Bounds on the Complexity of Local and Real-time Branching Programs , 1988, Journal of Information Processing and Cybernetics.

[7]  Pierre Marquis,et al.  A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..

[8]  Stefan Mengel,et al.  Tractable QBF by Knowledge Compilation , 2019, STACS.

[9]  Mateus de Oliveira Oliveira.  Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function , 2017, Theory of Computing Systems.

[10]  Friedrich Slivovsky,et al.  Knowledge Compilation Meets Communication Complexity , 2016, IJCAI.

[11]  Daniël Paulusma,et al.  Model Counting for CNF Formulas of Bounded Modular Treewidth , 2015, Algorithmica.

[12]  Pierre Senellart,et al.  Connecting Knowledge Compilation Classes Width Parameters , 2018, Theory of Computing Systems.

[13]  Robin Thomas,et al.  A separator theorem for graphs with an excluded minor and its applications , 1990, STOC '90.

[14]  Hubie Chen,et al.  Quantified Constraint Satisfaction and Bounded Treewidth , 2004, ECAI.

[15]  Stefan Mengel,et al.  QBF as an Alternative to Courcelle's Theorem , 2018, SAT.

[16]  Armando Tacchella,et al.  Dependent and Independent Variables in Propositional Satisfiability , 2002, JELIA.

[17]  Johann A. Makowsky,et al.  Counting truth assignments of formulas of bounded tree-width or clique-width , 2008, Discret. Appl. Math..

[18]  Marko Samer,et al.  Algorithms for propositional model counting , 2007, J. Discrete Algorithms.

[19]  Friedrich Slivovsky,et al.  On Compiling CNFs into Structured Deterministic DNNFs , 2015, SAT.

[20]  Pierre Senellart,et al.  Connecting Width and Structure in Knowledge Compilation , 2018, ICDT.

[21]  Jan Arne Telle,et al.  Solving #SAT and MAXSAT by Dynamic Programming , 2015, J. Artif. Intell. Res..

[22]  Georg Gottlob,et al.  Bounded treewidth as a key to tractability of knowledge representation and reasoning , 2006, Artif. Intell..

[23]  M. Vatshelle.  New Width Parameters of Graphs , 2012 .

[24]  Robert Ganian,et al.  New Width Parameters for Model Counting , 2017, SAT.

[25]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[26]  Carsten Sinz,et al.  Towards an Optimal CNF Encoding of Boolean Cardinality Constraints , 2005, CP.

[27]  Vladimir Gurvich,et al.  Boolean Functions: Read-once functions , 2011 .

[28]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[29]  Bruno Courcelle,et al.  On the model-checking of monadic second-order formulas with edge set quantifications , 2012, Discret. Appl. Math..

[30]  Stefan Mengel,et al.  Understanding model counting for $β$-acyclic CNF-formulas , 2014, ArXiv.

[31]  Adnan Darwiche,et al.  New Compilation Languages Based on Structured Decomposability , 2008, AAAI.

[32]  E. Kushilevitz,et al.  Communication Complexity: Basics , 1996 .

[33]  Stefan Szeider,et al.  Circuit Treewidth, Sentential Decision, and Query Compilation , 2017, PODS.

[34]  Marko Samer,et al.  Constraint satisfaction with bounded treewidth revisited , 2010, J. Comput. Syst. Sci..

[35]  Stefan Szeider,et al.  Model Counting for Formulas of Bounded Clique-Width , 2013, ISAAC.