规范性在自自底向上的知识编纂中的作用
On the Role of Canonicity in Bottom-up Knowledge Compilation
摘要：
我们考虑自自底向上的【形】的编译知识库的问题，这通常是一个polytime函数的存在，使用布尔运算符（通常称为应用功能）相结合的编译预测。虽然已知对于某些语言存在这样的多时间应用函数（例如，OBDDs），而对于其他（例如，DNNF），它在某些语言中的存在仍然未知。在后者中，最近引入了句子决策图（SDD）语言，对于未简化的SDD存在多时间应用函数，但对于简化的SDD（即规范SDD）仍然未知。我们在本文中解决了这个悬而未决的问题，并考虑了它的一些理论和实践意义。我们报告的一些调查结果质疑自自底向上的【形】编译，语言规范和应用功能的复杂性之间的关系的共同智慧。
英文摘要：
We consider the problem of bottom-up compilation of knowledge bases, which is usually predicated on the existence of a polytime function for combining compilations using Boolean operators (usually called an Apply function). While such a polytime Apply function is known to exist for certain languages (e.g., OBDDs) and not exist for others (e.g., DNNF), its existence for certain languages remains unknown. Among the latter is the recently introduced language of Sentential Decision Diagrams (SDDs), for which a polytime Apply function exists for unreduced SDDs, but remains unknown for reduced ones (i.e. canonical SDDs). We resolve this open question in this paper and consider some of its theoretical and practical implications. Some of the findings we report question the common wisdom on the relationship between bottom-up compilation, language canonicity and the complexity of the Apply function.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
