自自底向上的知识编译中中间结果的下界
Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation
摘要:
自自底向上的【形】知识编译是一种通过使用所谓的应用函数迭代地结合约束来生成函数表示的范例。当输入不能有效地编译成一种语言(通常是一类电路)时,因为最佳编译表示是可证明的大,问题不在于编译算法,而在于选择一种对输入限制太大的语言。相比之下,在本文中,我们看看CNF公式,非常小的电路存在,并期待在最一般的语言之一,即结构化可分解否定范式(str-DNNF)的自自底向上的【形】编译的效率。我们证明,虽然输入有恒定的大小表示为str-DNNF,任何自自底向上的【形】的编译在一般的设置,其中连接和结构修改是允许的,需要指数的时间和空间,因为大的中间结果产生。这无条件地证明了自自底向上的【形】编译的低效率在于自自底向上的【形】范式本身。
英文摘要:
Bottom-up knowledge compilation is a paradigm for generating representations of functions by iteratively conjoining constraints using a so-called apply function. When the input is not efficiently compilable into a language - generally a class of circuits - because optimal compiled representations are provably large, the problem is not the compilation algorithm as much as the choice of a language too restrictive for the input. In contrast, in this paper, we look at CNF formulas for which very small circuits exists and look at the efficiency of their bottom-up compilation in one of the most general languages, namely that of structured decomposable negation normal forms (str-DNNF). We prove that, while the inputs have constant size representations as str-DNNF, any bottom-up compilation in the general setting where conjunction and structure modification are allowed takes exponential time and space, since large intermediate results have to be produced. This unconditionally proves that the inefficiency of bottom-up compilation resides in the bottom-up paradigm itself.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。