[go: up one dir, main page]

Follow
Luca Geatti
Title
Cited by
Cited by
Year
Linear Temporal Logic Modulo Theories over Finite Traces.
L Geatti, A Gianola, N Gigante
IJCAI 22, 2641-2647, 2022
402022
A SAT-based encoding of the one-pass and tree-shaped tableau system for LTL
L Geatti, N Gigante, A Montanari
International Conference on Automated Reasoning with Analytic Tableaux and …, 2019
272019
Decidable fragments of LTLf modulo theories
L Geatti, A Gianola, N Gigante, S Winkler
FRONTIERS IN ARTIFICIAL INTELLIGENCE AND APPLICATIONS 372, 811-818, 2023
232023
Complexity of safety and cosafety fragments of linear temporal logic
A Artale, L Geatti, N Gigante, A Mazzullo, A Montanari
Proceedings of the AAAI Conference on Artificial Intelligence 37 (5), 6236-6244, 2023
202023
BLACK: A fast, flexible and reliable LTL satisfiability checker
L Geatti, N Gigante, A Montanari
CEUR Workshop Proceedings 2987, 7-12, 2021
192021
SAT meets tableaux for linear temporal logic satisfiability
L Geatti, N Gigante, A Montanari, G Venturato
Journal of Automated Reasoning 68 (2), 6, 2024
172024
One-pass and tree-shaped tableau systems for TPTL and TPTLb+ Past
L Geatti, N Gigante, A Montanari, M Reynolds
Information and Computation 278, 2021
172021
Reactive synthesis from extended bounded response LTL specifications
A Cimatti, L Geatti, N Gigante, A Montanari, S Tonetta
# PLACEHOLDER_PARENT_METADATA_VALUE# 1, 83-92, 2020
162020
Extended bounded response LTL: a new safety fragment for efficient reactive synthesis
A Cimatti, L Geatti, N Gigante, A Montanari, S Tonetta
Formal Methods in System Design 64 (1), 1-49, 2024
152024
Past matters: Supporting LTL+ Past in the BLACK satisfiability checker
L Geatti, N Gigante, A Montanari, G Venturato
28th International Symposium on Temporal Representation and Reasoning (TIME …, 2021
132021
Foundations of reactive synthesis for declarative process specifications
L Geatti, M Montali, A Rivkin
Proceedings of the AAAI Conference on Artificial Intelligence 38 (16), 17416 …, 2024
72024
A singly exponential transformation of LTL [X, F] into pure past LTL
A Artale, L Geatti, N Gigante, A Mazzullo, A Montanari
Proceedings of the International Conference on Principles of Knowledge …, 2023
72023
LTL over finite words can be exponentially more succinct than pure-past LTL, and vice versa
A Artale, L Geatti, N Gigante, A Mazzullo, A Montanari
LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS 278, 2, 2023
72023
A first-order logic characterisation of safety and co-safety languages.
A Cimatti, L Geatti, N Gigante, A Montanari, S Tonetta
FoSSaCS, 244-263, 2022
72022
Controller synthesis for timeline-based games
R Acampora, L Geatti, N Gigante, A Montanari, V Picotti
arXiv preprint arXiv:2209.10319, 2022
62022
Expressiveness of extended bounded response LTL
A Cimatti, L Geatti, N Gigante, A Montanari, S Tonetta
arXiv preprint arXiv:2109.08319, 2021
62021
Reactive synthesis from extended bounded response LTL specifications. In 2020 Formal Methods in Computer Aided Design, FMCAD 2020, Haifa, Israel, September 21-24, 2020 (2020)
A Cimatti, L Geatti, N Gigante, A Montanari, S Tonetta
IEEE, 2020
62020
First-Order Automata
L Geatti, A Gianola, N Gigante
Proceedings of the AAAI Conference on Artificial Intelligence 39 (14), 14940 …, 2025
52025
Evaluating LLMs Capabilities at Natural Language to Logic Translation: A Preliminary Investigation
A Brunello, R Ferrarese, L Geatti, E Marzano, A Montanari, ...
CEUR WORKSHOP PROCEEDINGS 3904, 103-110, 2025
52025
Reactive synthesis for DECLARE via symbolic automata
L Geatti, M Montali, A Rivkin
arXiv preprint arXiv:2212.10875, 2022
52022
The system can't perform the operation now. Try again later.
Articles 1–20