<h2>LIPIcs, Volume 120, TIME 2018</h2>
<ul>
<li>
<span class="authors">Natasha Alechina, Kjetil Nørvåg, and Wojciech Penczek</span>
<span class="title">LIPIcs, Volume 120, TIME'18, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018">10.4230/LIPIcs.TIME.2018</a>
</li>
<li>
<span class="authors">Natasha Alechina, Kjetil Nørvåg, and Wojciech Penczek</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.0">10.4230/LIPIcs.TIME.2018.0</a>
</li>
<li>
<span class="authors">Stéphane Demri</span>
<span class="title">On Temporal and Separation Logics (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.1">10.4230/LIPIcs.TIME.2018.1</a>
</li>
<li>
<span class="authors">Michael H. Böhlen, Anton Dignös, Johann Gamper, and Christian S. Jensen</span>
<span class="title">Database Technology for Processing Temporal Data (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.2">10.4230/LIPIcs.TIME.2018.2</a>
</li>
<li>
<span class="authors">Wojciech Jamroga</span>
<span class="title">Model Checking Strategic Ability - Why, What, and Especially: How? (Invited Paper)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.3">10.4230/LIPIcs.TIME.2018.3</a>
</li>
<li>
<span class="authors">George Athanasopoulos, George Paliouras, Dimitrios Vogiatzis, Grigorios Tzortzis, and Nikos Katzouris</span>
<span class="title">Predicting the Evolution of Communities with Online Inductive Logic Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.4">10.4230/LIPIcs.TIME.2018.4</a>
</li>
<li>
<span class="authors">Alexander Bolotov, Montserrat Hermo, and Paqui Lucio</span>
<span class="title">Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.5">10.4230/LIPIcs.TIME.2018.5</a>
</li>
<li>
<span class="authors">Laura Bozzelli, Aniello Murano, and Loredana Sorrentino</span>
<span class="title">Results on Alternating-Time Temporal Logics with Linear Past</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.6">10.4230/LIPIcs.TIME.2018.6</a>
</li>
<li>
<span class="authors">Davide Bresolin, Enrico Cominato, Simone Gnani, Emilio Muñoz-Velasco, and Guido Sciavicco</span>
<span class="title">Extracting Interval Temporal Logic Rules: A First Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.7">10.4230/LIPIcs.TIME.2018.7</a>
</li>
<li>
<span class="authors">Massimo Cairo, Luke Hunsberger, and Romeo Rizzi</span>
<span class="title">Faster Dynamic Controllability Checking for Simple Temporal Networks with Uncertainty</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.8">10.4230/LIPIcs.TIME.2018.8</a>
</li>
<li>
<span class="authors">Carlo Combi and Roberto Posenato</span>
<span class="title">Extending Conditional Simple Temporal Networks with Partially Shrinkable Uncertainty</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.9">10.4230/LIPIcs.TIME.2018.9</a>
</li>
<li>
<span class="authors">Carlo Comin and Romeo Rizzi</span>
<span class="title">On Restricted Disjunctive Temporal Problems: Faster Algorithms and Tractability Frontier</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.10">10.4230/LIPIcs.TIME.2018.10</a>
</li>
<li>
<span class="authors">Andreas Dohr, Christiane Engels, and Andreas Behrend</span>
<span class="title">Algebraic Operators for Processing Sets of Temporal Intervals in Relational Databases</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.11">10.4230/LIPIcs.TIME.2018.11</a>
</li>
<li>
<span class="authors">Marco Gavanelli, Alessandro Passantino, and Guido Sciavicco</span>
<span class="title">Deciding the Consistency of Branching Time Interval Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.12">10.4230/LIPIcs.TIME.2018.12</a>
</li>
<li>
<span class="authors">Nicola Gigante, Angelo Montanari, Marta Cialdea Mayer, Andrea Orlandini, and Mark Reynolds</span>
<span class="title">A Game-Theoretic Approach to Timeline-Based Planning with Uncertainty</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.13">10.4230/LIPIcs.TIME.2018.13</a>
</li>
<li>
<span class="authors">Luke Hunsberger and Roberto Posenato</span>
<span class="title">Sound-and-Complete Algorithms for Checking the Dynamic Controllability of Conditional Simple Temporal Networks with Uncertainty</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.14">10.4230/LIPIcs.TIME.2018.14</a>
</li>
<li>
<span class="authors">Luke Hunsberger and Roberto Posenato</span>
<span class="title">Reducing epsilon-DC Checking for Conditional Simple Temporal Networks to DC Checking</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.15">10.4230/LIPIcs.TIME.2018.15</a>
</li>
<li>
<span class="authors">Daniel Kernberger and Martin Lange</span>
<span class="title">On the Expressive Power of Hybrid Branching-Time Logics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.16">10.4230/LIPIcs.TIME.2018.16</a>
</li>
<li>
<span class="authors">Malte S. Kließ, Catholijn M. Jonker, and M. Birna van Riemsdijk</span>
<span class="title">A Temporal Logic for Modelling Activities of Daily Living</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.17">10.4230/LIPIcs.TIME.2018.17</a>
</li>
<li>
<span class="authors">Julius Köpke, Johann Eder, and Jianwen Su</span>
<span class="title">GSM+T: A Timed Artifact-Centric Process Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.18">10.4230/LIPIcs.TIME.2018.18</a>
</li>
<li>
<span class="authors">Malek Mouhoub, Hamad Al Marri, and Eisa Alanazi</span>
<span class="title">Learning Qualitative Constraint Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.19">10.4230/LIPIcs.TIME.2018.19</a>
</li>
<li>
<span class="authors">Georgios M. Santipantakis, Akrivi Vlachou, Christos Doulkeridis, Alexander Artikis, Ioannis Kontopoulos, and George A. Vouros</span>
<span class="title">A Stream Reasoning System for Maritime Monitoring</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.20">10.4230/LIPIcs.TIME.2018.20</a>
</li>
<li>
<span class="authors">Pattreeya Tanisaro and Gunther Heidemann</span>
<span class="title">An Empirical Study on Bidirectional Recurrent Neural Networks for Human Motion Recognition</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.21">10.4230/LIPIcs.TIME.2018.21</a>
</li>
<li>
<span class="authors">Lewis Tolonen, Tim French, and Mark Reynolds</span>
<span class="title">Population Based Methods for Optimising Infinite Behaviours of Timed Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.22">10.4230/LIPIcs.TIME.2018.22</a>
</li>
<li>
<span class="authors">Przemyslaw Andrzej Walega</span>
<span class="title">Computational Complexity of a Core Fragment of Halpern-Shoham Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2018.23">10.4230/LIPIcs.TIME.2018.23</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