PulseAugur
EN
LIVE 15:42:19

New ASP(Q) variant and FLINGO language enhance AI constraint programming

By PulseAugur Editorial · [4 sources] ·

Researchers have introduced "2-ASP(Q)^w," a new class of Answer Set Programming (ASP) programs with two quantifiers and weak constraints, capable of capturing optimization problems up to the Delta_3^P complexity class. This work provides a complete complexity characterization for computational tasks within this class and presents novel strategies for computing quantified answer sets using a Counterexample-Guided Abstraction Refinement (CEGAR) technique. An experimental evaluation demonstrates the effectiveness of these techniques on challenging benchmarks. Additionally, a new language and tool called "flingO" have been developed to integrate ASP expressiveness into linear integer constraints, enhancing Constraint Answer Set Programming (CASP) for real-world applications. AI

IMPACT These advancements in ASP(Q) and CASP could lead to more expressive and efficient AI systems for complex optimization and constraint satisfaction problems.

RANK_REASON The cluster consists of academic papers detailing theoretical advancements and practical implementations in AI programming paradigms.

Read on arXiv cs.AI →

AI-generated summary · Google Gemini · from 4 sources. How we write summaries →

New ASP(Q) variant and FLINGO language enhance AI constraint programming

COVERAGE [4]

  1. arXiv cs.AI TIER_1 English(EN) · Andrea Cuteri, Giuseppe Mazzotta, Francesco Ricca ·

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

    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…

  2. arXiv cs.AI TIER_1 English(EN) · Francesco Ricca ·

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

    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…

  3. Hugging Face Daily Papers TIER_1 English(EN) ·

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

    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…

  4. arXiv cs.AI TIER_1 English(EN) · Jorge Fandinno, Pedro Cabalar, Philipp Wanko, Torsten Schaub ·

    FLINGO -- Instilling ASP Expressiveness into Linear Integer Constraints

    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…

RELATED ENTITIES

RELATED TOPICS