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

稳定-不稳定语义:超越常规逻辑程序的NP

Stable-Unstable Semantics: Beyond NP with Normal Logic Programs

Helsinki Institute for Information Technology HIIT(赫尔辛基信息技术研究所);Department of Computer Science Aalto University(阿尔托大学计算机科学系)

Bart Bogaerts, Tomi Janhunen, Shahab Tasharrofi

摘要:

标准答案集程序设计(ASP)的目标是从多项式时间层次结构(PH)的第一层开始求解搜索问题。使用ASP处理NP之外的搜索问题就不那么简单了。析取逻辑程序的类提供了达到PH的第二级的最突出的方式,但是将相应的硬问题编码为析取程序通常需要复杂的技术,例如饱和或元解释。这种技术的应用很容易导致非专家无法访问的编码。此外,虽然析取ASP求解器通常依赖于对(co-)NP oracle的调用,但可能难以从输入程序中检测到oracle正在被访问的位置。在其他形式主义中,如量化布尔公式(QBF),底层oracle的接口更透明,因为它显式地记录在公式的量词前缀中。另一方面,从建模的角度来看,ASP比QBF具有优势。丰富的高级语言(如ASP-Core-2)提供了各种各样的原语,可以对搜索问题进行简洁而自然的编码。在本文中,我们提出了一种新的逻辑编程-基于建模范式,结合了ASP和QBF的最佳功能。我们开发了所谓的组合逻辑程序,其中预言机被直接转换为(正常的)逻辑程序本身。递归体现这种建设使逻辑编程任意高层次的PH值。我们开发了一个概念验证实现我们的新范式。本文件正在考虑被TPLP接受。

英文摘要:

Standard answer set programming (ASP) targets at solving search problems from the first level of the polynomial time hierarchy (PH). Tackling search problems beyond NP using ASP is less straightforward. The class of disjunctive logic programs offers the most prominent way of reaching the second level of the PH, but encoding respective hard problems as disjunctive programs typically requires sophisticated techniques such as saturation or meta-interpretation. The application of such techniques easily leads to encodings that are inaccessible to non-experts. Furthermore, while disjunctive ASP solvers often rely on calls to a (co-)NP oracle, it may be difficult to detect from the input program where the oracle is being accessed. In other formalisms, such as Quantified Boolean Formulas (QBFs), the interface to the underlying oracle is more transparent as it is explicitly recorded in the quantifier prefix of a formula. On the other hand, ASP has advantages over QBFs from the modeling perspective. The rich high-level languages such as ASP-Core-2 offer a wide variety of primitives that enable concise and natural encodings of search problems. In this paper, we present a novel logic programming--based modeling paradigm that combines the best features of ASP and QBFs. We develop so-called combined logic programs in which oracles are directly cast as (normal) logic programs themselves. Recursive incarnations of this construction enable logic programming on arbitrarily high levels of the PH. We develop a proof-of-concept implementation for our new paradigm. This paper is under consideration for acceptance in TPLP.

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

↑