5 citations · 23 across the 18 of their papers we have counts for
18 papers
Fixing FOLIO and MALLS: Verified Annotations and an LLM-assisted Framework to Focus Human Relabeling
Andrea Brunello, Cristian Curaba, Luca Geatti +3
Accurate translation from Natural Language to First-Order Logic (NL-to-FOL) underpins neurosymbolic AI systems and Natural Language Inference (NLI), making the quality of NL-to-FOL…
Do LLMs Really Struggle at NL-FOL Translation? Revealing their Strengths via a Novel Benchmarking Strategy
Andrea Brunello, Luca Geatti, Michele Mignani +2
Due to its expressiveness and unambiguous nature, First-Order Logic (FOL) is a powerful formalism for representing concepts expressed in natural language (NL). This is useful, e.g.…
Automata-less Monitoring via Trace-Checking (Extended Version)
Andrea Brunello, Luca Geatti, Angelo Montanari +1
In runtime verification, monitoring consists of analyzing the current execution of a system and determining, on the basis of the observed finite trace, whether all its possible con…
Interpretable Early Failure Detection via Machine Learning and Trace Checking-based Monitoring
Andrea Brunello, Luca Geatti, Angelo Montanari +1
Monitoring is a runtime verification technique that allows one to check whether an ongoing computation of a system (partial trace) satisfies a given formula. It does not need a com…
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…
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…
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…
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…
Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version)
Luca Geatti, Alessio Mansutti, Angelo Montanari
This paper focuses on succinctness results for fragments of Linear Temporal Logic with Past (LTL) devoid of binary temporal operators like until, and provides methods to establish…
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…
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…
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…
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…
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…
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…
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…
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…
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…