Luca Geatti

Orcid: 0000-0002-7125-787X

According to our database1, Luca Geatti authored at least 36 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
SAT Meets Tableaux for Linear Temporal Logic Satisfiability.
J. Autom. Reason., June, 2024

Fairness, assumptions, and guarantees for extended bounded response LTL+P synthesis.
Softw. Syst. Model., April, 2024

Cascade products and Wheeler automata.
Theor. Comput. Sci., 2024

A General Automata Model for First-Order Temporal Logics (Extended Version).
CoRR, 2024

Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version).
CoRR, 2024

Learning What to Monitor: Using Machine Learning to Improve past STL Monitoring.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems.
Proceedings of the Foundations of Software Science and Computation Structures, 2024

SMT-Based Symbolic Model-Checking for Operator Precedence Languages.
Proceedings of the Computer Aided Verification - 36th International Conference, 2024

Foundations of Reactive Synthesis for Declarative Process Specifications.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
A first-order logic characterization of safety and co-safety languages.
Log. Methods Comput. Sci., 2023

GR(1) is equivalent to R(1).
Inf. Process. Lett., 2023

Decidable Fragments of LTLf Modulo Theories (Extended Version).
CoRR, 2023

Torwards Infinite-State Verification and Planning with Linear Temporal Logic Modulo Theories (Extended Abstract).
Proceedings of the 30th International Symposium on Temporal Representation and Reasoning, 2023

LTL over Finite Words Can Be Exponentially More Succinct Than Pure-Past LTL, and vice versa.
Proceedings of the 30th International Symposium on Temporal Representation and Reasoning, 2023

Qualitative past Timeline-Based Games (Extended Abstract).
Proceedings of the 30th International Symposium on Temporal Representation and Reasoning, 2023

Towards Machine Learning Enhanced LTL Monitoring.
Proceedings of the Short Paper Proceedings of the 5th Workshop on Artificial Intelligence and Formal Verification, 2023

A Landscape of First-Order Linear Temporal Logics in Infinite-State Verification and Temporal Ontologies.
Proceedings of the Short Paper Proceedings of the 5th Workshop on Artificial Intelligence and Formal Verification, 2023

A Singly Exponential Transformation of LTL[X, F] into Pure Past LTL.
Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

A Linear-size Cascade Decomposition for Wheeler Automata.
Proceedings of the 24th Italian Conference on Theoretical Computer Science, 2023

Decidable Fragments of LTL<sub>f</sub> Modulo Theories.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Foundations of Collaborative sfDECLARE.
Proceedings of the Business Process Management Forum, 2023

Complexity of Safety and coSafety Fragments of Linear Temporal Logic.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Reactive Synthesis for DECLARE via symbolic automata.
CoRR, 2022

Controller Synthesis for Timeline-based Games.
Proceedings of the 13th International Symposium on Games, 2022

Linear Temporal Logic Modulo Theories over Finite Traces (Extended Version).
CoRR, 2022

Linear Temporal Logic Modulo Theories over Finite Traces.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

A first-order logic characterisation of safety and co-safety languages.
Proceedings of the Foundations of Software Science and Computation Structures, 2022

2021
One-pass and tree-shaped tableau systems for TPTL and TPTL<sub>b</sub>+Past.
Inf. Comput., 2021

Expressiveness of Extended Bounded Response LTL.
Proceedings of the Proceedings 12th International Symposium on Games, 2021

Past Matters: Supporting LTL+Past in the BLACK Satisfiability Checker.
Proceedings of the 28th International Symposium on Temporal Representation and Reasoning, 2021

BLACK: A Fast, Flexible and Reliable LTL Satisfiability Checker.
Proceedings of the 3rd Workshop on Artificial Intelligence and Formal Verification, 2021

2020
Safe Decomposition of Startup Requirements: Verification and Synthesis.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2020

Reactive Synthesis from Extended Bounded Response LTL Specifications.
Proceedings of the 2020 Formal Methods in Computer Aided Design, 2020

2019
A SAT-Based Encoding of the One-Pass and Tree-Shaped Tableau System for LTL.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2019

An Abstract Distributed Middleware for Transactions over Heterogeneous Stores.
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

2018
One-Pass and Tree-Shaped Tableau Systems for TPTL and TPTLb+Past.
Proceedings of the Proceedings Ninth International Symposium on Games, 2018


  Loading...