arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1912.01430cs.CCcs.AI
收藏

结构化$d$ -DNNF与SDD的关系

On the relation between structured $d$-DNNFs and SDDs

TU Dortmund(多特蒙德工业大学)

Beate Bollig, Martin Farenholtz

摘要:

结构化的$d$ -DNNF和SDD是在知识编译中用作命题理论被编译成的目标语言的受限否定范式电路。结构化是由所谓的vtree强加的。根据定义,SDD是受限制的结构化$d$ -DNNF。Beame和Liew(2015)以及Bova和Szeider(2017)提到了结构化$d$ -DNNF是否真的比SDD更通用的问题。多项式大小表示(w.r.t.定义所表示函数的布尔变量的数量。)本文的主要结果是证明了一个函数可以用多项式大小的SDD表示,如果该函数及其补函数具有多项式大小的结构$d$ -DNNF,它们尊重相同的vtree。

英文摘要:

Structured $d$-DNNFs and SDDs are restricted negation normal form circuits used in knowledge compilation as target languages into which propositional theories are compiled. Structuredness is imposed by so-called vtrees. By definition SDDs are restricted structured $d$-DNNFs. Beame and Liew (2015) as well as Bova and Szeider (2017) mentioned the question whether structured $d$-DNNFs are really more general than SDDs w.r.t. polynomial-size representations (w.r.t. the number of Boolean variables the represented functions are defined on.) The main result in the paper is the proof that a function can be represented by SDDs of polynomial size if the function and its complement have polynomial-size structured $d$-DNNFs that respect the same vtree.

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

↑