arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2311.10040cs.LOcs.CC
收藏

可高效编译的约束语言的特征刻画

A characterization of efficiently compilable constraint languages

Technische Universität Ilmenau(埃尔朗根-纽伦堡工业大学);Univ. Artois, CNRS, Centre de Recherche en Informatique de Lens (CRIL)(阿尔图瓦大学、法国国家科学研究中心、Lens信息学研究中心)

Christoph Berkholz, Stefan Mengel, Hermann Wilhelm

AI总结:

该研究刻画了可高效编译的约束语言的特征,明确强分块可分解性等性质是约束语言能生成多项式大小表示的关键,得到了知识编译类的完整特征。

摘要:

知识编译的核心任务是将CNF-SAT实例编译为一种简洁的表示格式,以支持可满足性测试、计数或枚举所有解等高效操作。该领域研究的有用表示格式包括有序二元决策图(OBDDs)、可分解否定范式电路(DNNFs)等。虽然已知存在需要指数级大小表示的CNF公式,但对于除布尔析取子句之外的其他类型约束,相关研究较少。约束满足问题(CSP)是一种强大的框架,它通过允许任意有限域上的任意约束集合,对CNF-SAT进行了泛化。本工作的主要目标是理解对于何种类型的约束(也称为约束语言),可以高效计算多项式大小的表示。我们完全回答了该问题,并根据目标格式是否结构化,证明了可高效编译的约束语言的两种紧特征刻画。我们首先确定了“强分块可分解性”的组合性质,并证明若约束语言具有该性质,则可计算线性大小的DNNF表示;对于所有其他约束语言,我们构造了可证明需要指数级大小DNNF的CSP实例族。对于“强一致分块可分解”约束语言的子类,我们得到了结构化DNNF的类似二分法。事实上,强(一致)分块可分解性甚至允许分别高效编译为OBDD和FBDD的多值类似物,因此我们得到了介于OBDDs和DNNFs之间所有知识编译类的完整特征刻画。

英文摘要:

A central task in knowledge compilation is to compile a CNF-SAT instance into a succinct representation format that allows efficient operations such as testing satisfiability, counting, or enumerating all solutions. Useful representation formats studied in this area range from ordered binary decision diagrams (OBDDs) to circuits in decomposable negation normal form (DNNFs). While it is known that there exist CNF formulas that require exponential size representations, the situation is less well studied for other types of constraints than Boolean disjunctive clauses. The constraint satisfaction problem (CSP) is a powerful framework that generalizes CNF-SAT by allowing arbitrary sets of constraints over any finite domain. The main goal of our work is to understand for which type of constraints (also called the constraint language) it is possible to efficiently compute representations of polynomial size. We answer this question completely and prove two tight characterizations of efficiently compilable constraint languages, depending on whether target format is structured. We first identify the combinatorial property of ``strong blockwise decomposability'' and show that if a constraint language has this property, we can compute DNNF representations of linear size. For all other constraint languages we construct families of CSP-instances that provably require DNNFs of exponential size. For a subclass of ``strong uniformly blockwise decomposable'' constraint languages we obtain a similar dichotomy for structured DNNFs. In fact, strong (uniform) blockwise decomposability even allows efficient compilation into multi-valued analogs of OBDDs and FBDDs, respectively. Thus, we get complete characterizations for all knowledge compilation classes between O(B)DDs and DNNFs.

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

↑