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

利用树宽求解答案集及其局限性

Answer Set Solving exploiting Treewidth and its Limits

Markus Hecher

摘要:

参数化算法近年来得到了广泛的研究,并允许通过利用相应问题实例的参数来解决困难问题。在那里,一个目标是设计算法,其中运行时间在这个参数中是指数的。树宽是一个研究得很好的结构参数。典型地,利用树宽的参数化算法采用或计算树分解,树分解是将图布置成树,并且通过树分解上的动态规划来部分地评估问题。在我们的研究中,我们希望利用树宽的背景下回答集编程(ASP),声明式建模和求解框架,已成功地应用于几个应用领域和行业多年。到目前为止,我们提出了完整的ASP-Core-2语法的ASP算法,特别是在计算答案集方面。由于树分解上的动态规划本身很适合于计数,我们设计了一个投影模型计数的框架,它适用于ASP,抽象论证,甚至适用于多项式层次中更高的问题。给定标准假设的计算复杂性,我们建立了一个新的方法来显示下限,我们表明,我们的算法的最坏情况下的运行时间不能显着改善。

英文摘要:

Parameterized algorithms have been subject to extensive research of recent years and allow to solve hard problems by exploiting a parameter of the corresponding problem instances. There, one goal is to devise algorithms, where the runtime is exponential exclusively in this parameter. One particular well-studied structural parameter is treewidth. Typically, a parameterized algorithm utilizing treewidth takes or computes a tree decomposition, which is an arrangement of a graph into a tree, and evaluates the problem in parts by dynamic programming on the tree decomposition. In our research, we want to exploit treewidth in the context of Answer Set Programming (ASP), a declarative modeling and solving framework, which has been successfully applied in several application domains and industries for years. So far, we presented algorithms for ASP for the full ASP-Core-2 syntax, which is competitive especially when it comes to counting answer sets. Since dynamic programming on tree decomposition lands itself well to counting, we designed a framework for projected model counting, which applies to ASP, abstract argumentation and even to problems higher in the polynomial hierarchy. Given standard assumptions in computational complexity, we established a novel methodology for showing lower bounds, and we showed that most worst-case runtimes of our algorithms cannot be significantly improved.

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

↑