Nicola Gigante

Orcid: 0000-0002-2254-4821

According to our database1, Nicola Gigante authored at least 42 papers between 2015 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

Inferring Markov Chains to Describe Convergent Tumor Evolution With CIMICE.
IEEE ACM Trans. Comput. Biol. Bioinform., 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

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

Standpoint Linear Temporal Logic.
Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 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

On the Compilability of Bounded Numeric Planning.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Declare MoGeS: Model Generator and Specializer.
Proceedings of the Doctoral Consortium and Demo Track 2023 at the International Conference on Process Mining 2023 co-located with the 5th International Conference on Process Mining (ICPM 2023), 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

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

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

Decidability and complexity of action-based temporal planning over dense time.
Artif. Intell., 2022

On the Expressive Power of Intermediate and Conditional Effects in Temporal Planning.
Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, 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

LTL Modulo Theories over Finite Traces: modeling, verification, open questions.
Proceedings of the Short Paper Proceedings of the 4th Workshop on Artificial Intelligence and Formal Verification, 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

Fairness, Assumptions, and Guarantees for Extended Bounded Response LTL+P Synthesis.
Proceedings of the Software Engineering and Formal Methods - 19th International Conference, 2021

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

2020
On timeline-based games and their complexity.
Theor. Comput. Sci., 2020

Complexity of Qualitative Timeline-Based Planning.
Proceedings of the 27th International Symposium on Temporal Representation and Reasoning, 2020

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

2019
Timeline-based planning: Expressiveness and Complexity.
CoRR, 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

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

A Game-Theoretic Approach to Timeline-Based Planning with Uncertainty.
Proceedings of the 25th International Symposium on Temporal Representation and Reasoning, 2018

A Novel Automata-Theoretic Approach to Timeline-Based Planning.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

2017
A One-Pass Tree-Shaped Tableau for LTL+Past.
Proceedings of the LPAR-21, 2017

Bounded Timed Propositional Temporal Logic with Past Captures Timeline-based Planning with Bounded Constraints.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

On the Complexity and Expressiveness of Automated Planning Languages Supporting Temporal Reasoning.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Complexity of Timeline-Based Planning.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

2016
Timelines Are Expressive Enough to Capture Action-Based Temporal Planning.
Proceedings of the 23rd International Symposium on Temporal Representation and Reasoning, 2016

Leviathan: A New LTL Satisfiability Checking Tool Based on a One-Pass Tree-Shaped Tableau.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform.
Proceedings of the Language and Automata Theory and Applications, 2015


  Loading...