arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1104.2788cs.CCcs.AI
收藏

可跟踪的嵌入式集合编程的后门

Backdoors to Tractable Answer-Set Programming

Vienna University of Technology(维也纳工业大学);University of Potsdam(波茨坦大学)

Johannes Klaus Fichte, Stefan Szeider

摘要:

答案集编程(ASP)是一种越来越流行的声明式编程框架,它允许通过形成析取逻辑程序的规则和约束来描述问题。特别是,许多人工智能的问题,如推理在一个非单调设置可以直接制定在ASP。虽然ASP的主要问题是高计算复杂性,位于多项式层次的第二层,ASP的几个限制已被确定在文献中,ASP问题变得易于处理。在本文中,我们使用后门的概念,以确定新的限制,使ASP问题易于处理。小后门是一组原子,代表通过搜索空间的“聪明的推理捷径”,并代表问题输入中的隐藏结构。后门的概念广泛应用于命题可满足性和约束满足等领域。我们表明,它可以卓有成效地适应ASP。我们演示了如何后门可以作为一个统一的框架,容纳几个听话的限制ASP已知的文献。此外,我们展示了后门如何使我们能够部署最近的算法结果从参数化复杂性理论域的答案集编程。

英文摘要:

Answer Set Programming (ASP) is an increasingly popular framework for declarative programming that admits the description of problems by means of rules and constraints that form a disjunctive logic program. In particular, many AI problems such as reasoning in a nonmonotonic setting can be directly formulated in ASP. Although the main problems of ASP are of high computational complexity, located at the second level of the Polynomial Hierarchy, several restrictions of ASP have been identified in the literature, under which ASP problems become tractable. In this paper we use the concept of backdoors to identify new restrictions that make ASP problems tractable. Small backdoors are sets of atoms that represent "clever reasoning shortcuts" through the search space and represent a hidden structure in the problem input. The concept of backdoors is widely used in the areas of propositional satisfiability and constraint satisfaction. We show that it can be fruitfully adapted to ASP. We demonstrate how backdoors can serve as a unifying framework that accommodates several tractable restrictions of ASP known from the literature. Furthermore, we show how backdoors allow us to deploy recent algorithmic results from parameterized complexity theory to the domain of answer set programming.

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

↑