研究人员引入了“2-ASP(Q)^w”，一类具有两个量词和弱约束的新型回答集编程（ASP）程序，能够捕获高达Delta_3^P复杂度类的优化问题。这项工作为该类中的计算任务提供了完整的复杂度表征，并提出了一种使用反例引导抽象细化（CEGAR）技术计算量化回答集的新策略。实验评估证明了这些技术在挑战性基准上的有效性。此外，还开发了一种名为“flingO”的新语言和工具，将ASP的表达能力集成到线性整数约束中，从而增强了用于实际应用的约束回答集编程（CASP）。 AI
影响 ASP(Q)和CASP的这些进展可能带来更具表现力和效率的AI系统，以解决复杂的优化和约束满足问题。
排序理由 该集群包含详细介绍AI编程范式中理论进展和实际实现的学术论文。
AI 生成摘要 · Google Gemini · 来自 4 个来源。 我们如何撰写摘要 →
arXiv:2605.27338v1 Announce Type: new 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 rele…
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 enoug…
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 enoug…
arXiv:2602.09620v2 Announce Type: replace Abstract: Constraint Answer Set Programming (CASP) is a hybrid paradigm that enriches Answer Set Programming (ASP) with numerical constraint processing, a crucial requirement for many real-world applications. However, the specification of…