<h2>LIPIcs, Volume 278, TIME 2023</h2>
<ul>
<li>
<span class="authors">Alexander Artikis, Florian Bruse, and Luke Hunsberger</span>
<span class="title">LIPIcs, Volume 278, TIME 2023, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023">10.4230/LIPIcs.TIME.2023</a>
</li>
<li>
<span class="authors">Alexander Artikis, Florian Bruse, and Luke Hunsberger</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.0">10.4230/LIPIcs.TIME.2023.0</a>
</li>
<li>
<span class="authors">Laura Nenzi</span>
<span class="title">Learning Temporal Logic Formulas from Time-Series Data (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.1">10.4230/LIPIcs.TIME.2023.1</a>
</li>
<li>
<span class="authors">Alessandro Artale, Luca Geatti, Nicola Gigante, Andrea Mazzullo, and Angelo Montanari</span>
<span class="title">LTL over Finite Words Can Be Exponentially More Succinct Than Pure-Past LTL, and vice versa</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.2">10.4230/LIPIcs.TIME.2023.2</a>
</li>
<li>
<span class="authors">Alexis Baudin, Lionel Tabourier, and Clémence Magnien</span>
<span class="title">LSCPM: Communities in Massive Real-World Link Streams by Clique Percolation Method</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.3">10.4230/LIPIcs.TIME.2023.3</a>
</li>
<li>
<span class="authors">Beatrice Amico, Carlo Combi, Romeo Rizzi, and Pietro Sala</span>
<span class="title">Discovering Predictive Dependencies on Multi-Temporal Relations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.4">10.4230/LIPIcs.TIME.2023.4</a>
</li>
<li>
<span class="authors">Yakoub Salhi and Michael Sioutis</span>
<span class="title">Prime Scenarios in Qualitative Spatial and Temporal Reasoning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.5">10.4230/LIPIcs.TIME.2023.5</a>
</li>
<li>
<span class="authors">Saumya Shankar, Srinivas Pinisetty, and Thierry Jéron</span>
<span class="title">Bounded-Memory Runtime Enforcement of Timed Properties</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.6">10.4230/LIPIcs.TIME.2023.6</a>
</li>
<li>
<span class="authors">Hsi-Ming Ho and Khushraj Madnani</span>
<span class="title">More Than 0s and 1s: Metric Quantifiers and Counting over Timed Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.7">10.4230/LIPIcs.TIME.2023.7</a>
</li>
<li>
<span class="authors">Alessandro Bregoli, Karin Rathsman, Marco Scutari, Fabio Stella, and Søren Wengel Mogensen</span>
<span class="title">Analyzing Complex Systems with Cascades Using Continuous-Time Bayesian Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.8">10.4230/LIPIcs.TIME.2023.8</a>
</li>
<li>
<span class="authors">Willem Conradie, Riccardo Monego, Emilio Muñoz-Velasco, Guido Sciavicco, and Ionel Eduard Stan</span>
<span class="title">A Sound and Complete Tableau System for Fuzzy Halpern and Shoham’s Interval Temporal Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.9">10.4230/LIPIcs.TIME.2023.9</a>
</li>
<li>
<span class="authors">Florian Bruse, Marit Kastaun, Martin Lange, and Sören Möller</span>
<span class="title">The Calculus of Temporal Influence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.10">10.4230/LIPIcs.TIME.2023.10</a>
</li>
<li>
<span class="authors">Anshuman Misra and Ajay D. Kshemkalyani</span>
<span class="title">Detecting Causality in the Presence of Byzantine Processes: The Synchronous Systems Case</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.11">10.4230/LIPIcs.TIME.2023.11</a>
</li>
<li>
<span class="authors">Michael Sioutis</span>
<span class="title">Embarrassingly Greedy Inconsistency Resolution of Qualitative Constraint Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.12">10.4230/LIPIcs.TIME.2023.12</a>
</li>
<li>
<span class="authors">Curtis E. Dyreson</span>
<span class="title">Optimization of Nonsequenced Queries Using Log-Segmented Timestamps</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.13">10.4230/LIPIcs.TIME.2023.13</a>
</li>
<li>
<span class="authors">Periklis Mantenoglou</span>
<span class="title">An Event Calculus for Run-Time Reasoning (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.14">10.4230/LIPIcs.TIME.2023.14</a>
</li>
<li>
<span class="authors">Nikos Giatrakos</span>
<span class="title">SSTRESED: Scalable Semantic Trajectory Extraction for Simple Event Detection over Streaming Movement Data (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.15">10.4230/LIPIcs.TIME.2023.15</a>
</li>
<li>
<span class="authors">Yakoub Salhi and Michael Sioutis</span>
<span class="title">A Decomposition Framework for Inconsistency Handling in Qualitative Spatial and Temporal Reasoning (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.16">10.4230/LIPIcs.TIME.2023.16</a>
</li>
<li>
<span class="authors">Nikos Katzouris and Georgios Paliouras</span>
<span class="title">Answer Set Automata: A Learnable Pattern Specification Framework for Complex Event Recognition (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.17">10.4230/LIPIcs.TIME.2023.17</a>
</li>
<li>
<span class="authors">Petro-Foti Kamberi, Evgenios Kladis, and Charilaos Akasiadis</span>
<span class="title">A Benchmark for Early Time-Series Classification (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.18">10.4230/LIPIcs.TIME.2023.18</a>
</li>
<li>
<span class="authors">Marco Sälzer and Silvia Beddar-Wiesing</span>
<span class="title">Time-Aware Robustness of Temporal Graph Neural Networks for Link Prediction (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.19">10.4230/LIPIcs.TIME.2023.19</a>
</li>
<li>
<span class="authors">Luke Hunsberger and Roberto Posenato</span>
<span class="title">Converting Simple Temporal Networks with Uncertainty into Dispatchable Form - Faster (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.20">10.4230/LIPIcs.TIME.2023.20</a>
</li>
<li>
<span class="authors">Luca Geatti, Alessandro Gianola, and Nicola Gigante</span>
<span class="title">Torwards Infinite-State Verification and Planning with Linear Temporal Logic Modulo Theories (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.21">10.4230/LIPIcs.TIME.2023.21</a>
</li>
<li>
<span class="authors">Renato Acampora, Luca Geatti, Nicola Gigante, and Angelo Montanari</span>
<span class="title">Qualitative past Timeline-Based Games (Extended Abstract)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2023.22">10.4230/LIPIcs.TIME.2023.22</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing