GMGiuseppe Mazzotta

Giuseppe Mazzotta

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Giuseppe Mazzotta has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Computational Complexity of Disjunctive Answer Set Programming with Quantifiers

    by Giuseppe Mazzotta, Francesco Ricca, Mirek Truszczynski

  • Open Access

    2-ASP(Q) Programs with Weak Constraints: Complexity and Efficient Implementation

    by 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, denoted as 2-ASP Superscript w w $^w$ (Q). 2-ASP Superscript w 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 Δ 3 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 $^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.

  • Solving Hard Combinatorial Optimization Problems with PyQASP

    by Damiano Azzolini, Nicola Leone, Giuseppe Mazzotta, Francesco Ricca


  • Lazy Atom Discovery in Compilation-Based ASP Solving

    by Andrea Cuteri, Giuseppe Mazzotta, Francesco Ricca

  • Open Access

    Blending Grounding and Compilation for Efficient ASP Solving

    by Carmine Dodaro, Giuseppe Mazzotta, Francesco Ricca

    Answer Set Programming (ASP) is a widely recognized formalism for Knowledge Representation and Reasoning. Traditional ASP systems, that employ the ground and solve architecture, are subject to the grounding bottleneck (i.e., variable-elimination can exhaust all computational resources). Compilation-based approaches have recently demonstrated how grounding can be effectively bypassed by compiling rules into propagators that simulate them. However, compiling an entire ASP program is not always advantageous. In this paper, we present both a program rewriting technique and an algorithm for the compilation of grounding that allow for unrestricted blending of grounding and compilation. We implement these techniques in a hybrid ASP system that compares favourably with state-of-the-art ASP solvers on established benchmarks.


  • Open Access

    Enumerating Minimal Unsatisfiable Cores of LTLf formulas

    by Antonio Ielo, Giuseppe Mazzotta, Rafael Peñaloza, Francesco Ricca

    Linear Temporal Logic over finite traces ($\text{LTL}_f$) is a widely used formalism with applications in AI, process mining, model checking, and more. The primary reasoning task for $\text{LTL}_f$ is satisfiability checking; yet, the recent focus on explainable AI has increased interest in analyzing inconsistent formulas, making the enumeration of minimal explanations for infeasibility a relevant task also for $\text{LTL}_f$. This paper introduces a novel technique for enumerating minimal unsatisfiable cores (MUCs) of an $\text{LTL}_f$ specification. The main idea is to encode a $\text{LTL}_f$ formula into an Answer Set Programming (ASP) specification, such that the minimal unsatisfiable subsets (MUSes) of the ASP program directly correspond to the MUCs of the original $\text{LTL}_f$ specification. Leveraging recent advancements in ASP solving yields a MUC enumerator achieving good performance in experiments conducted on established benchmarks from the literature.

  • Open Access

    Quantifying over Optimum Answer Sets

    by 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) lacks a method for encoding in an elegant and compact way problems requiring a polynomial number of calls to an oracle in $\Sigma _n^p$ (that is, problems in $\Delta _{n+1}^p$ ). Such problems include, in particular, optimization problems. In this paper, we propose an extension of ASP(Q), in which component programs may contain weak constraints. Weak constraints can be used both for expressing local optimization within quantified component programs and for modeling global optimization criteria. We showcase the modeling capabilities of the new formalism through various application scenarios. Further, we study its computational properties obtaining complexity results and unveiling non-obvious characteristics of ASP(Q) programs with weak constraints.


  • Open Access

    Unit Testing in ASP Revisited: Language and Test-Driven Development Environment

    by Giovanni Amendola, Giuseppe Mazzotta, Francesco Ricca, Tobias Berei

    Unit testing frameworks are nowadays considered a best practice, included in almost all modern software development processes, to achieve rapid development of correct specifications. Knowledge representation and reasoning paradigms such as Answer Set Programming (ASP), that have been used in industry-level applications, are not an exception. Indeed, the first unit testing specification language for ASP was proposed in 2011 as a feature of the ASPIDE development environment. Later, a more portable unit testing language was included in the LANA annotation language. In this paper we revisit both languages and tools for unit testing in ASP. We propose a new unit test specification language that allows one to inline tests within ASP programs, and we identify the computational complexity of the tasks associated with checking the various program-correctness assertions. Test-case specifications are transparent to the traditional evaluation, but can be interpreted by a specific testing tool. Thus, we present a novel environment supporting test-driven development of ASP programs.


  • Open Access

    Compilation of Tight ASP Programs

    by Carmine Dodaro, Giuseppe Mazzotta, Francesco Ricca

    Answer Set Programming (ASP) is a well-known AI formalism. Traditional ASP systems, that follow the “ground&solve” approach, are intrinsically limited by the so-called grounding bottleneck. Basically, the grounding step (i.e., variable-elimination) can be computationally expensive, and even unfeasible in several cases of practical interest. Recent work demonstrated that the grounding bottleneck can be partially overcome by compiling in external propagators subprograms acting as constraints. In this paper a novel compilation technique is presented that can be applied to tight normal programs; thus, the class of ASP programs that can be compiled is extended beyond constraints. The approach is implemented in the new system PROASP. PROASP skips entirely the grounding phase and performs solving by injecting custom propagators in GLUCOSE. An experiment, conducted on grounding-intensive ASP benchmarks, shows that PROASP is capable of solving instances that are out of reach for state-of-the-art ASP systems.