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

超越NP:通过答案集进行量化

Beyond NP: Quantifying over Answer Sets

University of Calabria(卡拉布里亚大学);University of Kentucky(肯塔基大学)

Giovanni Amendola, Francesco Ricca, Mirek Truszczynski

摘要:

答案集编程(ASP)是一种逻辑编程范式,其特征在于具有相对较高的建模能力的纯声明性语言。事实上,ASP可以以一种紧凑而优雅的方式在NP中建模问题。然而,用ASP对NP之外的问题建模是复杂的,一方面,另一方面,它又局限于NP中的问题。量化布尔公式的方式扩展SAT公式的启发NP模型的问题,我们提出了一个扩展的ASP引入量词的稳定模型的程序。我们将这种新语言命名为带量词的ASP(ASP(Q))。在本文中,我们确定ASP(Q)的计算特性,我们突出了它的建模能力,报告自然编码的几个复杂的问题与应用程序在人工智能和数论,我们比较ASP(Q)与相关的语言。可以说,ASP(Q)允许人们以直接的方式在多项式层次中建模问题,提供了ASP在NP类之外的优雅扩展。正在考虑接受TPLP。

英文摘要:

Answer Set Programming (ASP) is a logic programming paradigm featuring a purely declarative language with comparatively high modeling capabilities. Indeed, ASP can model problems in NP in a compact and elegant way. However, modeling problems beyond NP with ASP is known to be complicated, on the one hand, and limited to problems in Σ^P_2 on the other. Inspired by the way Quantified Boolean Formulas extend SAT formulas to model problems beyond NP, we propose an extension of ASP that introduces quantifiers over stable models of programs. We name the new language ASP with Quantifiers (ASP(Q)). In the paper we identify computational properties of ASP(Q); we highlight its modeling capabilities by reporting natural encodings of several complex problems with applications in artificial intelligence and number theory; and we compare ASP(Q) with related languages. Arguably, ASP(Q) allows one to model problems in the Polynomial Hierarchy in a direct way, providing an elegant expansion of ASP beyond the class NP. Under consideration for acceptance in TPLP.

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

↑