2-ASP(Q) programs with weak constraints: Complexity and efficient implementation 事件

2-ASP(Q) programs with weak constraints: Complexity and efficient implementation arXiv:2605.27338v1 Announce Type: cross Abstract: ASP(Q) extends Answer Set Programming (ASP) with Quantifiers over answer sets. In this paper we focus on the class of ASP(Q) programs with two quantifiers and weak constraints, denoted as 2-ASP(Q)^w. 2-ASP(Q)^w is a practically relevant fragment of ASP(Q) that is expressive enough to capture optimization problems up to the class Delta_3^P. On the theoretical side, w