No. Title Author Year
1 LTL over Finite Words Can Be Exponentially More Succinct Than Pure-Past LTL, and vice versa Artale, Alessandro et al. 2023
2 Qualitative past Timeline-Based Games (Extended Abstract) Acampora, Renato et al. 2023
3 Past Matters: Supporting LTL+Past in the BLACK Satisfiability Checker Geatti, Luca et al. 2021
4 Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes Bozzelli, Laura et al. 2021
5 Complexity of Qualitative Timeline-Based Planning Della Monica, Dario et al. 2020
6 On a Temporal Logic of Prefixes and Infixes Bozzelli, Laura et al. 2020
7 Complexity Analysis of a Unifying Algorithm for Model Checking Interval Temporal Logic Bozzelli, Laura et al. 2019
8 Interval Temporal Logic for Visibly Pushdown Systems Bozzelli, Laura et al. 2019
9 Synthesis of LTL Formulas from Natural Language Texts: State of the Art and Research Directions Brunello, Andrea et al. 2019
10 Taming the Complexity of Timeline-Based Planning over Dense Temporal Domains Bozzelli, Laura et al. 2019
11 A Game-Theoretic Approach to Timeline-Based Planning with Uncertainty Gigante, Nicola et al. 2018
12 Evaluation of Temporal Datasets via Interval Temporal Logic Model Checking Della Monica, Dario et al. 2017
13 Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption Bozzelli, Laura et al. 2017
14 Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison Bozzelli, Laura et al. 2016
15 A Model Checking Procedure for Interval Temporal Logics based on Track Representatives Molinari, Alberto et al. 2015
16 Decidability of the Interval Temporal Logic ABB over the Natural Numbers Montanari, Angelo et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 16

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI