量化最优答案集
Quantifying over Optimum Answer Sets
AI总结:
本文提出带量词的答案集编程(ASP(Q))的扩展,允许组件程序包含弱约束,以支持局部和全局优化,并研究了其计算复杂性。
摘要:
带量词的答案集编程(ASP(Q))已被引入,旨在将ASP建模自然扩展到多项式层级(PH)中的问题。然而,ASP(Q)缺乏一种优雅且紧凑的方法来编码需要对$Σ_n^p$中的预言机进行多项式次调用的问题(即$Δ_{n+1}^p$中的问题)。这类问题尤其包括优化问题。在本文中,我们提出了ASP(Q)的一种扩展,其中组件程序可以包含弱约束。弱约束既可用于在量化组件程序内表达局部优化,也可用于建模全局优化标准。我们通过各种应用场景展示了新形式体系的建模能力。此外,我们研究了其计算性质,获得了复杂性结果,并揭示了带弱约束的ASP(Q)程序的非显而易见特征。
英文摘要:
Answer Set Programming with Quantifiers (ASP(Q)) has been introduced to provide a natural extension of ASP modeling to problems in the polynomial hierarchy (PH). However, ASP(Q) lacks a method for encoding in an elegant and compact way problems requiring a polynomial number of calls to an oracle in $Σ_n^p$ (that is, problems in $Δ_{n+1}^p$). Such problems include, in particular, optimization problems. In this paper we propose an extension of ASP(Q), in which component programs may contain weak constraints. Weak constraints can be used both for expressing local optimization within quantified component programs and for modeling global optimization criteria. We showcase the modeling capabilities of the new formalism through various application scenarios. Further, we study its computational properties obtaining complexity results and unveiling non-obvious characteristics of ASP(Q) programs with weak constraints.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。