arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1303.4081cs.LO
收藏

知识宽度与知识编纂

Cliquewidth and Knowledge Compilation

Igor Razgon, Justyna Petke

摘要:

本文研究了布尔函数的宽度在布尔函数简洁表示中的作用。我们的主要陈述如下:设$Z$是一个布尔电路,其宽度为$k$。然后存在另一电路$Z^*$,其计算与$Z$相同的函数,具有至多$18k+2$的树宽,并且具有至多$4|Z|$门,其中$|Z|$是$Z$的门的数目。从这个意义上说,对于布尔函数的表示来说,树宽度并不比树宽度更“强大”。我们相信这是一个相当令人惊讶的事实,因为它与树宽上界意味着树宽上界的图形成了对比,反之亦然。我们证明了有用的新定理的知识汇编。特别是,我们表明,一个电路$Z$的宽度$k$可以编译成一个可分解的否定范式({ \sc dnnf})的大小$O(9^{18k}k^2|Z|)$和相同的运行时间。据我们所知,这是第一个结果,有效的知识编译参数化的一个布尔电路的宽度。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑