ACAndrea Cuteri
Andrea Cuteri
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Andrea Cuteri has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Francesco Ricca
University of Calabria
2 shared publications - Giuseppe Mazzotta
University of Calabria
2 shared publications
Latest Publications
- Open Access
- 1 March 2026
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 26 (1-2) , 112-129
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 Superscript w $^w$ (Q). 2-ASP Superscript w $^w$ (Q) is a practically relevant fragment of ASP(Q) that is expressive enough to capture optimization problems up to the class normal upper Delta 3 Superscript upper P $\Delta ^P_3$ . On the theoretical side, we provide a complete complexity characterization of the main computational tasks for 2-ASP Superscript w $^w$ (Q) programs, including tight completeness results and the analysis of nontrivial cases that have not been addressed in previous works. On the practical side, we introduce novel strategies for computing (optimal) quantified answer sets in the CASPER system, that rely on a Counterexample-Guided Abstraction Refinement (CEGAR) technique tailored to ASP(Q). An experimental evaluation on hard benchmarks from different application domains shows that the proposed techniques are effective in practice.- 1 March 2026
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 26 (1-2) , 112-129
Open Access2-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 Superscript w $^w$ (Q). 2-ASP Superscript w $^w$ (Q) is a practically relevant fragment of ASP(Q) that is expressive enough to capture optimization problems up to the class normal upper Delta 3 Superscript upper P $\Delta ^P_3$ . On the theoretical side, we provide a complete complexity characterization of the main computational tasks for 2-ASP Superscript w $^w$ (Q) programs, including tight completeness results and the analysis of nontrivial cases that have not been addressed in previous works. On the practical side, we introduce novel strategies for computing (optimal) quantified answer sets in the CASPER system, that rely on a Counterexample-Guided Abstraction Refinement (CEGAR) technique tailored to ASP(Q). An experimental evaluation on hard benchmarks from different application domains shows that the proposed techniques are effective in practice. - 29 August 2025
- Published by Springer Nature
- p. 309-326
Lazy Atom Discovery in Compilation-Based ASP Solving
- 29 August 2025
- Published by Springer Nature
- p. 309-326
Lazy Atom Discovery in Compilation-Based ASP Solving