In this paper we study the role of cliquewidth in succinct representation of Boolean functions. Our main statement is the following: Let $Z$ be a Boolean circuit having cliquewidth $k$. Then there is another circuit $Z^*$ computing the same function as $Z$ having treewidth at most $18k+2$ and which has at most $4|Z|$ gates where $|Z|$ is the number of gates of $Z$. In this sense, cliquewidth is not more `powerful' than treewidth for the purpose of representation of Boolean functions. We believe this is quite a surprising fact because it contrasts the situation with graphs where an upper bound on the treewidth implies an upper bound on the cliquewidth but not vice versa.
We demonstrate the usefulness of the new theorem for knowledge compilation. In particular, we show that a circuit $Z$ of cliquewidth $k$ can be compiled into a Decomposable Negation Normal Form ({\sc dnnf}) of size $O(9^{18k}k^2|Z|)$ and the same runtime. To the best of our knowledge, this is the first result on efficient knowledge compilation parameterized by cliquewidth of a Boolean circuit.
Knowledge Compilation for Boolean Functional Synthesis
给定一个布尔公式F(X,Y),其中X是一个输出向量,Y是一个输入向量,布尔函数综合问题要求我们为X计算一个Skolem函数向量G(Y),使得只要\exists X F(X,Y)成立,F(G(Y),Y)就成立。本文研究了规格说明F(X,Y)的表示与综合复杂度之间的关系。我们引入了一个新的范式的布尔公式,称为SynNNF,保证多项式时间的合成,也多项式时间存在量化的一些顺序的变量。我们发现,几个范式研究的知识汇编文献中的SynNNF的包容,虽然SynNNF可以超多项式比他们更简洁。受这些结果的启发,我们提出了一个算法转换CNF的规格SynNNF,目的是解决布尔函数综合问题。一个原型实现的实验表明,这种方法解决了几个基准超出了国家的最先进的工具。
Indian Institute of Technology Bombay(印度理工学院班加罗尔分校);University of Toronto(多伦多大学);Vector Institute(向量研究所);Georgia Institute of Technology(佐治亚理工学院);National University of Singapore(新加坡国立大学)