We study the existential closures of several propositional languages L considered recently as target languages for knowledge compilation (KC), namely the incomplete fragments KROM-C, HORN-C, K/H-C, renH-C, AFF, and the corresponding disjunction closures KROM-C[∨], HORN-C[∨], K/H-C[∨], renH-C[∨], and AFF[∨]. We analyze the queries, transformations, expressiveness and succinctness of the resulting languages L[{exist}] in order to locate them in the KC map. As a by-product, we also address several issues concerning disjunction closures that were left open so far. From our investigation, the language HORN - C[∨, {exist}] (where disjunctions and existential quantifications can be applied to Horn CNF formulae) appears as an interesting target language for the KC purpose, challenging the influential DNNF languages.
展开▼
机译：我们研究了几种命题语言L最近考虑的目标封闭物作为知识编译（KC）的目标语言，即不完整的片段Krom-C，Horn-C，K / HC，Renh-C，AFF和相应的分离闭锁Krom -C [∨]，Horn-C [∨]，K / HC [∨]，renh-C [∨]和AFF [∨]。我们分析所得语言的查询，转换，表现力和简洁性L [{ident}]，以便在KC地图中定位它们。作为副产品，我们还解决了迄今为止留下开放的分离封闭问题的几个问题。从我们的调查中，语言角 - C [∨，{现有}]（其中剖钉和存在量化为Horn CNF公式）作为KC目的的一个有趣的目标语言，挑战了有影响力的DNNF语言。
展开▼
