arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.04832cs.AIcs.LO
收藏

结构化 d-DNNF 在否定运算下不封闭

Structured d-DNNF Is Not Closed Under Negation

Technische Universität Ilmenau(伊尔默瑙工业大学)

Harry Vinall-Smeeth

AI总结:

本文证明结构化 d-DNNF 不支持多项式时间的否定、析取和存在量化操作,且比 SDD 更简洁,并推广至算术电路展示 PSDD 与单调 AC 的差距。

摘要:

结构化 d-DNNF 和 SDD 都可能比 OBDD 指数级更简洁。此外,SDD 在可操作性上基本与 OBDD 相当。但这留下了两个重要的开放问题。首先,OBDD 是否比结构化 d-DNNF 支持更多可操作变换?其次,结构化 d-DNNF 是否比 SDD 更简洁?在本文中,我们对这两个问题都给出了肯定回答。对于第一个问题,我们证明,与 OBDD 不同,结构化 d-DNNF 不支持多项式时间的否定、析取或存在量化操作。作为推论,我们推断存在一些函数,它们具有等价的多项式规模的结构化 d-DNNF,但没有这样的 SDD 表示,从而回答了第二个问题。我们还将第二个结果推广到算术电路(AC),以展示 PSDD 与结构化 d-DNNF 的单调 AC 对应物之间的简洁性差距。

英文摘要:

Both structured d-DNNF and SDD can be exponentially more succinct than OBDD. Moreover, SDD is essentially as tractable as OBDD. But this has left two important open questions. Firstly, does OBDD support more tractable transformations than structured d-DNNF? And secondly, is structured d-DNNF more succinct than SDD? In this paper, we answer both questions in the affirmative. For the first question we show that, unlike OBDD, structured d-DNNF does not support polytime negation, disjunction, or existential quantification operations. As a corollary, we deduce that there are functions with an equivalent polynomial-sized structured d-DNNF but with no such representation as an SDD, thus answering the second question. We also lift this second result to arithmetic circuits (AC) to show a succinctness gap between PSDD and the monotone AC analogue to structured d-DNNF.

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

↑