arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.01856cs.AIcs.LO
收藏

非基本规则在答案集编程中的作用

The Power of Non-Ground Rules in Answer Set Programming

TU Wien(维也纳工业大学)

Manuel Bichler, Michael Morak, Stefan Woltran

摘要:

应答集编程(ASP)是一种成熟的逻辑程序设计语言,它为解决问题提供了直观的声明性语法。在传统的应用中,针对给定的问题设计一个固定的ASP程序,并将问题的实际实例作为一组事实输入程序。这种方法通常会导致程序具有非常短和简单的规则。然而,从复杂性分析中可以看出,这种方法限制了ASP的表达能力;事实上,整个NP检查可以编码成一个有界元的单个大规则体,在同一规则中执行猜测和检查。在这里,我们提出了一种新的范式编码的ASP中的困难问题,明确使用的大规则,取决于实际的问题的实例。我们说明了如何使用这种新的编码范式,提供的例子,从第一,第二,甚至第三级的多项式层次结构的问题。由于国家的最先进的求解器调整到短的规则,规则分解是在我们的方法的实际实现的关键技术。我们还提供了一些初步的基准测试表明,放弃指定一个固定的程序的方便的方式可以导致显着的速度。该文件正在考虑被TPLP接受。

英文摘要:

Answer set programming (ASP) is a well-established logic programming language that offers an intuitive, declarative syntax for problem solving. In its traditional application, a fixed ASP program for a given problem is designed and the actual instance of the problem is fed into the program as a set of facts. This approach typically results in programs with comparably short and simple rules. However, as is known from complexity analysis, such an approach limits the expressive power of ASP; in fact, an entire NP-check can be encoded into a single large rule body of bounded arity that performs both a guess and a check within the same rule. Here, we propose a novel paradigm for encoding hard problems in ASP by making explicit use of large rules which depend on the actual instance of the problem. We illustrate how this new encoding paradigm can be used, providing examples of problems from the first, second, and even third level of the polynomial hierarchy. As state-of-the-art solvers are tuned towards short rules, rule decomposition is a key technique in the practical realization of our approach. We also provide some preliminary benchmarks which indicate that giving up the convenient way of specifying a fixed program can lead to a significant speed-up. This paper is under consideration for acceptance into TPLP.

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

↑