default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicola Gigante
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Alessandro Cimatti, Luca Geatti
, Nicola Gigante, Angelo Montanari, Stefano Tonetta:
Extended bounded response LTL: a new safety fragment for efficient reactive synthesis. Formal Methods Syst. Des. 64(1): 1-49 (2024)- [j9]Luca Geatti, Nicola Gigante, Angelo Montanari, Gabriele Venturato:
SAT Meets Tableaux for Linear Temporal Logic Satisfiability. J. Autom. Reason. 68(2): 6 (2024) - [j8]Renato Acampora, Luca Geatti, Nicola Gigante, Angelo Montanari, Valentino Picotti:
Controller Synthesis for Timeline-based Games. Log. Methods Comput. Sci. 20(3) (2024) - [j7]Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta:
Fairness, assumptions, and guarantees for extended bounded response LTL+P synthesis. Softw. Syst. Model. 23(2): 427-453 (2024) - [j6]Nicolò Rossi, Nicola Gigante, Nicola Vitacolonna, Carla Piazza:
Inferring Markov Chains to Describe Convergent Tumor Evolution With CIMICE. IEEE ACM Trans. Comput. Biol. Bioinform. 21(1): 106-119 (2024) - [c35]Michele Chiari, Luca Geatti, Nicola Gigante, Matteo Pradella:
SMT-Based Symbolic Model-Checking for Operator Precedence Languages. CAV (1) 2024: 387-408 - [c34]Renato Acampora, Dario Della Monica, Luca Geatti, Nicola Gigante, Angelo Montanari, Pietro Sala:
Synthesis of Timeline-Based Planning Strategies Avoiding Determinization. GandALF 2024: 5-18 - [i11]Michele Chiari, Luca Geatti, Nicola Gigante, Matteo Pradella:
SMT-based Symbolic Model-Checking for Operator Precedence Languages. CoRR abs/2405.11327 (2024) - [i10]Luca Geatti, Alessandro Gianola, Nicola Gigante:
A General Automata Model for First-Order Temporal Logics (Extended Version). CoRR abs/2405.20057 (2024) - 2023
- [j5]Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta:
GR(1) is equivalent to R(1). Inf. Process. Lett. 179: 106319 (2023) - [j4]Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta:
A first-order logic characterization of safety and co-safety languages. Log. Methods Comput. Sci. 19(3) (2023) - [c33]Alessandro Artale, Luca Geatti, Nicola Gigante, Andrea Mazzullo, Angelo Montanari:
Complexity of Safety and coSafety Fragments of Linear Temporal Logic. AAAI 2023: 6236-6244 - [c32]Luca Geatti, Alessandro Gianola, Nicola Gigante, Sarah Winkler:
Decidable Fragments of LTLf Modulo Theories. ECAI 2023: 811-818 - [c31]Manal Laghmouch, Benoît Depaire, Nicola Gigante, Mieke Jans, Marco Montali:
Declare MoGeS: Model Generator and Specializer. ICPM Doctoral Consortium / Demo 2023 - [c30]Nicola Gigante, Enrico Scala:
On the Compilability of Bounded Numeric Planning. IJCAI 2023: 5341-5349 - [c29]Alessandro Artale, Luca Geatti, Nicola Gigante, Andrea Mazzullo, Angelo Montanari:
A Singly Exponential Transformation of LTL[X, F] into Pure Past LTL. KR 2023: 65-74 - [c28]Nicola Gigante, Lucía Gómez Álvarez, Tim S. Lyon:
Standpoint Linear Temporal Logic. KR 2023: 311-321 - [c27]Alessandro Artale, Luca Geatti, Nicola Gigante, Andrea Mazzullo:
A Landscape of First-Order Linear Temporal Logics in Infinite-State Verification and Temporal Ontologies. OVERLAY@AI*IA 2023: 85-92 - [c26]Alessandro Artale, Luca Geatti, Nicola Gigante, Andrea Mazzullo, Angelo Montanari:
LTL over Finite Words Can Be Exponentially More Succinct Than Pure-Past LTL, and vice versa. TIME 2023: 2:1-2:14 - [c25]Luca Geatti, Alessandro Gianola, Nicola Gigante:
Torwards Infinite-State Verification and Planning with Linear Temporal Logic Modulo Theories (Extended Abstract). TIME 2023: 21:1-21:3 - [c24]Renato Acampora, Luca Geatti, Nicola Gigante, Angelo Montanari:
Qualitative past Timeline-Based Games (Extended Abstract). TIME 2023: 22:1-22:3 - [i9]Nicola Gigante, Lucía Gómez Álvarez, Tim S. Lyon:
Standpoint Linear Temporal Logic. CoRR abs/2304.14243 (2023) - [i8]Renato Acampora, Luca Geatti, Nicola Gigante, Angelo Montanari, Valentino Picotti:
Controller Synthesis for Timeline-based Games. CoRR abs/2307.12289 (2023) - [i7]Luca Geatti, Alessandro Gianola, Nicola Gigante, Sarah Winkler:
Decidable Fragments of LTLf Modulo Theories (Extended Version). CoRR abs/2307.16840 (2023) - 2022
- [j3]Nicola Gigante, Andrea Micheli, Angelo Montanari, Enrico Scala:
Decidability and complexity of action-based temporal planning over dense time. Artif. Intell. 307: 103686 (2022) - [c23]Alessandro Gianola, Nicola Gigante:
LTL Modulo Theories over Finite Traces: modeling, verification, open questions. OVERLAY@AI*IA 2022: 13-19 - [c22]Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta:
A first-order logic characterisation of safety and co-safety languages. FoSSaCS 2022: 244-263 - [c21]Luca Geatti, Alessandro Gianola, Nicola Gigante:
Linear Temporal Logic Modulo Theories over Finite Traces. IJCAI 2022: 2641-2647 - [c20]Nicola Gigante, Andrea Micheli, Enrico Scala:
On the Expressive Power of Intermediate and Conditional Effects in Temporal Planning. KR 2022 - [c19]Renato Acampora, Luca Geatti, Nicola Gigante, Angelo Montanari, Valentino Picotti:
Controller Synthesis for Timeline-based Games. GandALF 2022: 131-146 - [i6]Luca Geatti, Alessandro Gianola, Nicola Gigante:
Linear Temporal Logic Modulo Theories over Finite Traces (Extended Version). CoRR abs/2204.13693 (2022) - [i5]Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta:
A first-order logic characterization of safety and co-safety languages. CoRR abs/2209.02307 (2022) - [i4]Alessandro Artale, Luca Geatti, Nicola Gigante, Andrea Mazzullo, Angelo Montanari:
Complexity of Safety and coSafety Fragments of Linear Temporal Logic. CoRR abs/2211.14913 (2022) - 2021
- [j2]Luca Geatti, Nicola Gigante, Angelo Montanari, Mark Reynolds:
One-pass and tree-shaped tableau systems for TPTL and TPTLb+Past. Inf. Comput. 278: 104599 (2021) - [c18]Luca Geatti, Nicola Gigante, Angelo Montanari:
BLACK: A Fast, Flexible and Reliable LTL Satisfiability Checker. OVERLAY@GandALF 2021: 7-12 - [c17]Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta:
Fairness, Assumptions, and Guarantees for Extended Bounded Response LTL+P Synthesis. SEFM 2021: 351-371 - [c16]Luca Geatti, Nicola Gigante, Angelo Montanari, Gabriele Venturato:
Past Matters: Supporting LTL+Past in the BLACK Satisfiability Checker. TIME 2021: 8:1-8:17 - [c15]Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta:
Expressiveness of Extended Bounded Response LTL. GandALF 2021: 152-165 - 2020
- [j1]Nicola Gigante, Angelo Montanari, Andrea Orlandini, Marta Cialdea Mayer, Mark Reynolds:
On timeline-based games and their complexity. Theor. Comput. Sci. 815: 247-269 (2020) - [c14]Nicola Gigante, Andrea Micheli, Angelo Montanari, Enrico Scala:
Decidability and Complexity of Action-Based Temporal Planning over Dense Time. AAAI 2020: 9859-9866 - [c13]Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta:
Reactive Synthesis from Extended Bounded Response LTL Specifications. FMCAD 2020: 83-92 - [c12]Dario Della Monica, Nicola Gigante, Salvatore La Torre, Angelo Montanari:
Complexity of Qualitative Timeline-Based Planning. TIME 2020: 16:1-16:13 - [e1]Nicola Gigante, Federico Mari, Andrea Orlandini:
Proceedings of the 1st Workshop on Artificial Intelligence and Formal Verification, Logic, Automata, and Synthesis, co-located with the 18th International Conference of the Italian Association for Artificial Intelligence, OVERLAY@AI*IA 2019, Rende, Italy, November 19-20, 2019. CEUR Workshop Proceedings 2509, CEUR-WS.org 2020 [contents] - [i3]Alessandro Cimatti, Luca Geatti, Nicola Gigante, Angelo Montanari, Stefano Tonetta:
Reactive Synthesis from Extended Bounded Response LTL Specifications. CoRR abs/2008.05335 (2020)
2010 – 2019
- 2019
- [c11]Luca Geatti, Nicola Gigante, Angelo Montanari:
A SAT-Based Encoding of the One-Pass and Tree-Shaped Tableau System for LTL. TABLEAUX 2019: 3-20 - [i2]Nicola Gigante:
Timeline-based planning: Expressiveness and Complexity. CoRR abs/1902.06123 (2019) - 2018
- [c10]Dario Della Monica, Nicola Gigante, Angelo Montanari, Pietro Sala:
A Novel Automata-Theoretic Approach to Timeline-Based Planning. KR 2018: 541-550 - [c9]Nicola Gigante, Angelo Montanari, Marta Cialdea Mayer, Andrea Orlandini, Mark Reynolds:
A Game-Theoretic Approach to Timeline-Based Planning with Uncertainty. TIME 2018: 13:1-13:17 - [c8]Luca Geatti, Nicola Gigante, Angelo Montanari, Mark Reynolds:
One-Pass and Tree-Shaped Tableau Systems for TPTL and TPTLb+Past. GandALF 2018: 176-190 - [i1]Nicola Gigante, Angelo Montanari, Marta Cialdea Mayer, Andrea Orlandini, Mark Reynolds:
A game-theoretic approach to timeline-based planning with uncertainty. CoRR abs/1807.04837 (2018) - 2017
- [c7]Nicola Gigante, Angelo Montanari, Marta Cialdea Mayer, Andrea Orlandini:
Complexity of Timeline-Based Planning. ICAPS 2017: 116-124 - [c6]Dario Della Monica, Nicola Gigante, Angelo Montanari, Pietro Sala, Guido Sciavicco:
Bounded Timed Propositional Temporal Logic with Past Captures Timeline-based Planning with Bounded Constraints. IJCAI 2017: 1008-1014 - [c5]Nicola Gigante:
On the Complexity and Expressiveness of Automated Planning Languages Supporting Temporal Reasoning. IJCAI 2017: 5181-5182 - [c4]Nicola Gigante, Angelo Montanari, Mark Reynolds:
A One-Pass Tree-Shaped Tableau for LTL+Past. LPAR 2017: 456-473 - 2016
- [c3]Matteo Bertello, Nicola Gigante, Angelo Montanari, Mark Reynolds:
Leviathan: A New LTL Satisfiability Checking Tool Based on a One-Pass Tree-Shaped Tableau. IJCAI 2016: 950-956 - [c2]Nicola Gigante, Angelo Montanari, Marta Cialdea Mayer, Andrea Orlandini:
Timelines Are Expressive Enough to Capture Action-Based Temporal Planning. TIME 2016: 100-109 - 2015
- [c1]Alberto Policriti, Nicola Gigante, Nicola Prezza:
Average Linear Time and Compressed Space Construction of the Burrows-Wheeler Transform. LATA 2015: 587-598
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-30 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
