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

后门可分解单调电路及其传播完全编码

Backdoor Decomposable Monotone Circuits and their Propagation Complete Encodings

Charles University(查理大学);Institute of Computer Science of the Czech Academy of Sciences(捷克科学院计算机科学研究所)

Petr Kučera, Petr Savický

摘要:

我们描述了后门可分解单调电路(BDMC)的编译语言,它概括了文献中出现的几个概念,例如DNF和后门树。一个$\mathcal{C}$ -BDMC语句是一个满足可分解性质(如DNNF)的单调电路,其中输入(或叶)与来自给定基类$\mathcal{C}$的CNF编码相关联。我们认为传播完全(PC)编码类作为一个基类,我们表明,PC-BDMC是多项式等价的PC编码。此外,我们用它来确定PC-BDMC和PC编码的知识编译图,包括对语言的有效操作列表的属性。

英文摘要:

We describe a compilation language of backdoor decomposable monotone circuits (BDMCs) which generalizes several concepts appearing in the literature, e.g. DNNFs and backdoor trees. A $\mathcal{C}$-BDMC sentence is a monotone circuit which satisfies decomposability property (such as in DNNF) in which the inputs (or leaves) are associated with CNF encodings from a given base class $\mathcal{C}$. We consider the class of propagation complete (PC) encodings as a base class and we show that PC-BDMCs are polynomially equivalent to PC encodings. Additionally, we use this to determine the properties of PC-BDMCs and PC encodings with respect to the knowledge compilation map including the list of efficient operations on the languages.

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

↑