2-ASP(Q) programs with weak constraints: Complexity and efficient implementation
The paper discusses 2-ASP(Q) programs with weak constraints, a significant area in Answer Set Programming. It provides a complete complexity characterization of computational tasks related to this class and introduces efficient strategies for computing quantified answer sets. Experimental evaluations demonstrate the effectiveness of the proposed techniques in practical applications.
- ▪The study focuses on 2-ASP(Q)^w, a fragment of ASP(Q) that addresses optimization problems up to the class Delta_3^P.
- ▪It offers a complete complexity characterization for the main computational tasks of 2-ASP(Q)^w programs.
- ▪Novel strategies for computing optimal quantified answer sets are introduced, utilizing a CEGAR technique tailored to ASP(Q).
arXiv cs.AI files mainly under ai research. We currently carry 1,128 of its stories.
Story provenance
Source · retrieval · rights · ranking — open for full record
inspect →
Story provenance
Attribution is not the same as permission. This drawer separates discovery metadata, excerpts, WeSearch-generated summaries, reuse status, and whether the publisher receives the visit. Nothing here claims a legal grant the publisher has not made.
Record
| Original publisher | arXiv cs.AI |
| Canonical URL | https://arxiv.org/abs/2605.27338 |
| Publication time | Wed, 27 May 2026 00:00:00 -0400 |
| Retrieval time | 2026-05-27T04:07:56.398Z |
| Last seen | 2026-05-27T04:07:56.398Z |
| Headline source | Publisher (no WeSearch rewrite) |
| Excerpt source | publisher body |
| Excerpt method | First ~120 words (~800 chars) of extracted publisher body, fair-use limited. |
| Summary | WeSearch · cerebras-chat (WeSearch summarizer) |
| Summary source text | contentText |
| Citation coverage | Summary is a WeSearch-generated derivative; primary citation is the original publisher URL. |
| Cluster | lnXlKjKsY-Pp |
| Cluster logic | Grouped by semantic title/content similarity across sources within a rolling window. Same-publisher template collisions are excluded from coverage comparison. |
| Ranking reason | Story pages are not engagement-ranked. Hub feeds use recency, with optional source-diversified chronological ordering (cap consecutive stories per source). No personalized ranking. |
| Publisher visit | Yes — open original |
| Substitutes article? | No — link-out required for full text |
Rights status (four layers)
WeSearch handling by dimension
| Indexing | May the item be indexed (stored, ranked, made findable)? | Allowed |
| Snippet | May a short excerpt of the publisher's text be shown? | Allowed |
| AI summary | May WeSearch generate its own short summary of the article? | Limited |
| Retrieval / RAG | May the content be exposed for third-party retrieval-augmented generation? | Not asserted |
| Model training | May the content be used to train AI models? | Not asserted |
| Commercial reuse | May the content be reused commercially? | Not permitted |
Basis: Derived from the published RSS/Atom feed. Contact: [email protected]. Reviewed: 2026-07-24.
Opening excerpt (first ~120 words) tap to expand
Computer Science > Artificial Intelligence arXiv:2605.27338 (cs) [Submitted on 26 May 2026] Title:2-ASP(Q) programs with weak constraints: Complexity and efficient implementation Authors:Andrea Cuteri, Giuseppe Mazzotta, Francesco Ricca View a PDF of the paper titled 2-ASP(Q) programs with weak constraints: Complexity and efficient implementation, by Andrea Cuteri and Giuseppe Mazzotta and Francesco Ricca View PDF HTML (experimental) 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.
…
Excerpt limited to ~120 words for fair-use compliance. The full article is at arXiv cs.AI.
Discussion
0 commentsMore from arXiv cs.AI
