Showing cs.AIShow all
3 papers · 1 filter
cs.AI2026
2-ASP(Q) programs with weak constraints: Complexity and efficient implementation
Andrea Cuteri, Giuseppe Mazzotta, Francesco Ricca
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, den…
cs.AI2024
Enumerating Minimal Unsatisfiable Cores of LTLf formulas
Antonio Ielo, Giuseppe Mazzotta, Rafael Peñaloza +1
Linear Temporal Logic over finite traces () is a widely used formalism with applications in AI, process mining, model checking, and more. The primary reasoning task f…
cs.AI2024
Quantifying over Optimum Answer Sets
Giuseppe Mazzotta, Francesco Ricca, Mirek Truszczynski
Answer Set Programming with Quantifiers (ASP(Q)) has been introduced to provide a natural extension of ASP modeling to problems in the polynomial hierarchy (PH). However, ASP(Q) la…