差分逻辑的算法与复杂性
Algorithms and Complexity of Difference Logic
AI总结:
研究差分逻辑存在性语句的真值判定复杂性,分析CNF下元数与系数界导致NP难,并给出时间与参数化复杂性全貌,推广至整数域与非CNF。
摘要:
差分逻辑(DL)是线性算术的一个片段,其中原子是形如 x+k ≤ y 的约束,其中变量 x,y 取值范围为 Q(有理数)或 Z(整数),k 为整数。我们研究判定存在性 DL 语句真值的复杂性。该问题出现在许多情境中:例如验证、生物信息学、电信以及人工智能中的时空推理。我们首先考虑具有有理数变量的 CNF(合取范式)语句。我们通过两个自然参数限制允许的子句:元数和系数界。对于这些参数的大多数选择,该问题是 NP 困难的。作为对此的回应,我们通过分析时间复杂性和参数化复杂性(相对于诸如原始树宽和关联树宽等已被充分研究的参数)来细化我们的理解。在这两种情况下,我们都获得了复杂性景观的全面图景。最后,我们将结果推广到整数域和非 CNF 语句。
英文摘要:
Difference Logic (DL) is a fragment of linear arithmetics where atoms are constraints x+k <= y for variables x,y (ranging over Q or Z) and integer k. We study the complexity of deciding the truth of existential DL sentences. This problem appears in many contexts: examples include verification, bioinformatics, telecommunications, and spatio-temporal reasoning in AI. We begin by considering sentences in CNF with rational-valued variables. We restrict the allowed clauses via two natural parameters: arity and coefficient bounds. The problem is NP-hard for most choices of these parameters. As a response to this, we refine our understanding by analyzing the time complexity and the parameterized complexity (with respect to well-studied parameters such as primal and incidence treewidth). We obtain a comprehensive picture of the complexity landscape in both cases. Finally, we generalize our results to integer domains and sentences that are not in CNF.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。