arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2402.03539cs.AIcs.LO
收藏

扩展版:关于回答集编程的结构硬度:结构能否有效限制析取的威力?

Extended Version of: On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?

Massachusetts Institute of Technology(麻省理工学院);TU Wien(维也纳工业大学)

Markus Hecher, Rafael Kiesel

AI总结:

本文研究析取回答集编程的结构硬度,证明顶点覆盖大小可实现单指数算法,而树深度、反馈顶点集和团宽需双指数下界,并给出从正规到析取程序的新颖归约。

摘要:

回答集编程(ASP)是一种通用的问题建模与求解框架,重点关注知识表示,且工业应用快速增长。迄今为止,复杂性研究已刻画了硬度及其来源,以二分法风格结果的形式提供了细粒度见解,并给出了详细的参数化复杂性图谱。不幸的是,对于众所周知的参数树宽,析取程序在合理复杂性假设下需要双指数运行时,这很快变得不可企及。我们处理析取ASP在程序规则结构(关联图)上的结构参数分类问题。首先,我们提供一个多项式核,以获得基于顶点覆盖大小的单指数运行时,尽管子集最小化并未在程序结构中表示。然后,我们将注意力转向严格优于顶点覆盖大小与树宽之间的结构参数。在此,我们为该范围内最突出的参数——树深度、反馈顶点集大小和团宽——提供了双指数下界。基于此,我们认为不幸的是,我们在顶点覆盖大小之外的选择有限。我们的结果提供了深入的硬度研究,依赖于从正规程序到析取程序的新颖归约,以复杂性增加换取指数级参数压缩。

英文摘要:

Answer Set Programming (ASP) is a generic problem modeling and solving framework with a strong focus on knowledge representation and a rapid growth of industrial applications. So far, the study of complexity resulted in characterizing hardness and determining their sources, fine-grained insights in the form of dichotomy-style results, as well as detailed parameterized complexity landscapes. Unfortunately, for the well-known parameter treewidth disjunctive programs require double-exponential runtime under reasonable complexity assumptions. This quickly becomes out of reach. We deal with the classification of structural parameters for disjunctive ASP on the program's rule structure (incidence graph). First, we provide a polynomial kernel to obtain single-exponential runtime in terms of vertex cover size, despite subset-minimization being not represented in the program's structure. Then we turn our attention to strictly better structural parameters between vertex cover size and treewidth. Here, we provide double-exponential lower bounds for the most prominent parameters in that range: treedepth, feedback vertex size, and cliquewidth. Based on this, we argue that unfortunately our options beyond vertex cover size are limited. Our results provide an in-depth hardness study, relying on a novel reduction from normal to disjunctive programs, trading the increase of complexity for an exponential parameter compression.

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

↑