activity
20182025
most citedOne-Pass and Tree-Shaped Tableau Systems for TPTL and TPTLb+Past

5 citations · 28 across the 17 of their papers we have counts for

collaborators

17 papers

cs.AI2025

Counterfactual Scenarios for Automated Planning

Nicola Gigante, Francesco Leofante, Andrea Micheli

Counterfactual Explanations (CEs) are a powerful technique used to explain Machine Learning models by showing how the input to a model should be minimally changed for the model to…

cs.AI2025

Synthesis of timeline-based planning strategies avoiding determinization

Dario Della Monica, Angelo Montanari, Pietro Sala

Qualitative timeline-based planning models domains as sets of independent, but interacting, components whose behaviors over time, the timelines, are governed by sets of qualitative…

cs.FL2024

Synthesis of Timeline-Based Planning Strategies Avoiding Determinization

Renato Acampora, Dario Della Monica, Luca Geatti +3

Qualitative timeline-based planning models domains as sets of independent, but interacting, components whose behaviors over time, the timelines, are governed by sets of qualitative…

cs.LO2024★ 1 cited

A General Automata Model for First-Order Temporal Logics (Extended Version)

Luca Geatti, Alessandro Gianola, Nicola Gigante

First-order linear temporal logic (FOLTL) is a flexible and expressive formalism capable of naturally describing complex behaviors and properties. Although the logic is in general…

cs.LO2024

SMT-based Symbolic Model-Checking for Operator Precedence Languages

Michele Chiari, Luca Geatti, Nicola Gigante +1

Operator Precedence Languages (OPL) have been recently identified as a suitable formalism for model checking recursive procedural programs, thanks to their ability of modeling the…

cs.AI2023★ 1 cited

Decidable Fragments of LTLf Modulo Theories (Extended Version)

Luca Geatti, Alessandro Gianola, Nicola Gigante +1

We study Linear Temporal Logic Modulo Theories over Finite Traces (LTLfMT), a recently introduced extension of LTL over finite traces (LTLf) where propositions are replaced by firs…

cs.AI2023

Controller Synthesis for Timeline-based Games

Renato Acampora, Luca Geatti, Nicola Gigante +2

In the timeline-based approach to planning, the evolution over time of a set of state variables (the timelines) is governed by a set of temporal constraints. Traditional timeline-b…

cs.AI2023

Standpoint Linear Temporal Logic

Nicola Gigante, Lucia {Gomez Alvarez}, Tim S. Lyon

Many complex scenarios require the coordination of agents possessing unique points of view and distinct semantic commitments. In response, standpoint logic (SL) was introduced in t…

cs.LO2022★ 3 cited

Complexity of Safety and coSafety Fragments of Linear Temporal Logic

Alessandro Artale, Luca Geatti, Nicola Gigante +2

Linear Temporal Logic (LTL) is the de-facto standard temporal logic for system specification, whose foundational properties have been studied for over five decades. Safety and cosa…

cs.AI2022★ 4 cited

Controller Synthesis for Timeline-based Games

Renato Acampora, Luca Geatti, Nicola Gigante +2

In the timeline-based approach to planning, originally born in the space sector, the evolution over time of a set of state variables (the timelines) is governed by a set of tempora…

cs.AI2022★ 2 cited

A first-order logic characterization of safety and co-safety languages

Alessandro Cimatti, Luca Geatti, Nicola Gigante +2

Linear Temporal Logic (LTL) is one of the most popular temporal logics, that comes into play in a variety of branches of computer science. Among the various reasons of its widespre…

cs.LO2022★ 3 cited

Linear Temporal Logic Modulo Theories over Finite Traces (Extended Version)

Luca Geatti, Alessandro Gianola, Nicola Gigante

This paper studies Linear Temporal Logic over Finite Traces (LTLf) where proposition letters are replaced with first-order formulas interpreted over arbitrary theories, in the spir…

cs.FL2021★ 3 cited

Expressiveness of Extended Bounded Response LTL

Alessandro Cimatti, Luca Geatti, Nicola Gigante +2

Extended Bounded Response LTL with Past (LTLEBR+P) is a safety fragment of Linear Temporal Logic with Past (LTL+P) that has been recently introduced in the context of reactive synt…

cs.FL2020★ 1 cited

Reactive Synthesis from Extended Bounded Response LTL Specifications

Alessandro Cimatti, Luca Geatti, Nicola Gigante +2

Reactive synthesis is a key technique for the design of correct-by-construction systems and has been thoroughly investigated in the last decades. It consists in the synthesis of a…

cs.AI2019★ 5 cited

Timeline-based planning: Expressiveness and Complexity

Nicola Gigante

Timeline-based planning is an approach originally developed in the context of space mission planning and scheduling, where problem domains are modelled as systems made of a number…

cs.LO2018★ 5 cited

One-Pass and Tree-Shaped Tableau Systems for TPTL and TPTLb+Past

Luca Geatti, Nicola Gigante, Angelo Montanari +1

In this paper, we propose a novel one-pass and tree-shaped tableau method for Timed Propositional Temporal Logic and for a bounded variant of its extension with past operators. Tim…

cs.AI2018

A game-theoretic approach to timeline-based planning with uncertainty

Nicola Gigante, Angelo Montanari, Marta Cialdea Mayer +2

In timeline-based planning, domains are described as sets of independent, but interacting, components, whose behaviour over time (the set of timelines) is governed by a set of temp…