<h2>LIPIcs, Volume 90, TIME 2017</h2>
<ul>
<li>
<span class="authors">Sven Schewe, Thomas Schneider, and Jef Wijsen</span>
<span class="title">LIPIcs, Volume 90, TIME'17, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017">10.4230/LIPIcs.TIME.2017</a>
</li>
<li>
<span class="authors">Sven Schewe, Thomas Schneider, and Jef Wijsen</span>
<span class="title">Front Matter, Table of Contents, Preface, Organization, List of Authors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.0">10.4230/LIPIcs.TIME.2017.0</a>
</li>
<li>
<span class="authors">Alessandro Artale, Roman Kontchakov, Alisa Kovtunova, Vladislav Ryzhikov, Frank Wolter, and Michael Zakharyaschev</span>
<span class="title">Ontology-Mediated Query Answering over Temporal Data: A Survey (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.1">10.4230/LIPIcs.TIME.2017.1</a>
</li>
<li>
<span class="authors">Javier Esparza</span>
<span class="title">Advances in Quantitative Analysis of Free-Choice Workflow Petri Nets (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.2">10.4230/LIPIcs.TIME.2017.2</a>
</li>
<li>
<span class="authors">Sheila A. McIlraith</span>
<span class="title">Plan and Program Synthesis: A New Look at Some Old Problems (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.3">10.4230/LIPIcs.TIME.2017.3</a>
</li>
<li>
<span class="authors">Antoine Amarilli, Mouhamadou Lamine Ba, Daniel Deutch, and Pierre Senellart</span>
<span class="title">Possible and Certain Answers for Queries over Order-Incomplete Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.4">10.4230/LIPIcs.TIME.2017.4</a>
</li>
<li>
<span class="authors">Jonathan Behaegel, Jean-Paul Comet, and Maxime Folschette</span>
<span class="title">Constraint Identification Using Modified Hoare Logic on Hybrid Models of Gene Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.5">10.4230/LIPIcs.TIME.2017.5</a>
</li>
<li>
<span class="authors">Laura Bozzelli, Aniello Murano, Giuseppe Perelli, and Loredana Sorrentino</span>
<span class="title">Hierarchical Cost-Parity Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.6">10.4230/LIPIcs.TIME.2017.6</a>
</li>
<li>
<span class="authors">Thomas Brihaye, Gilles Geeraerts, Hsi-Ming Ho, and Benjamin Monmege</span>
<span class="title">Timed-Automata-Based Verification of MITL over Signals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.7">10.4230/LIPIcs.TIME.2017.7</a>
</li>
<li>
<span class="authors">Massimo Cairo and Romeo Rizzi</span>
<span class="title">Dynamic Controllability Made Simple</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.8">10.4230/LIPIcs.TIME.2017.8</a>
</li>
<li>
<span class="authors">Massimo Cairo, Carlo Combi, Carlo Comin, Luke Hunsberger, Roberto Posenato, Romeo Rizzi, and Matteo Zavatteri</span>
<span class="title">Incorporating Decision Nodes into Conditional Simple Temporal Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.9">10.4230/LIPIcs.TIME.2017.9</a>
</li>
<li>
<span class="authors">Massimo Cairo, Luke Hunsberger, Roberto Posenato, and Romeo Rizzi</span>
<span class="title">A Streamlined Model of Conditional Simple Temporal Networks - Semantics and Equivalence Results</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.10">10.4230/LIPIcs.TIME.2017.10</a>
</li>
<li>
<span class="authors">Dario Della Monica, David de Frutos-Escrig, Angelo Montanari, Aniello Murano, and Guido Sciavicco</span>
<span class="title">Evaluation of Temporal Datasets via Interval Temporal Logic Model Checking</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.11">10.4230/LIPIcs.TIME.2017.11</a>
</li>
<li>
<span class="authors">Mathias Etcheverry and Dina Wonsever</span>
<span class="title">Time Expressions Recognition with Word Vectors and Neural Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.12">10.4230/LIPIcs.TIME.2017.12</a>
</li>
<li>
<span class="authors">Gilles Geeraerts, Eythan Levy, and Frédéric Pluquet</span>
<span class="title">Models and Algorithms for Chronology</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.13">10.4230/LIPIcs.TIME.2017.13</a>
</li>
<li>
<span class="authors">Valentin Goranko, Antti Kuusisto, and Raine Rönnholm</span>
<span class="title">CTL with Finitely Bounded Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.14">10.4230/LIPIcs.TIME.2017.14</a>
</li>
<li>
<span class="authors">Fabio Grandi, Federica Mandreoli, Riccardo Martoglia, and Wilma Penzo</span>
<span class="title">A Relational Algebra for Streaming Tables Living in a Temporal Database World</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.15">10.4230/LIPIcs.TIME.2017.15</a>
</li>
<li>
<span class="authors">Michael Grüninger and Zhuojun Li</span>
<span class="title">The Time Ontology of Allen's Interval Algebra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.16">10.4230/LIPIcs.TIME.2017.16</a>
</li>
<li>
<span class="authors">Daniel Kernberger and Martin Lange</span>
<span class="title">The Fully Hybrid mu-Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.17">10.4230/LIPIcs.TIME.2017.17</a>
</li>
<li>
<span class="authors">Marie Kiermeier and Martin Werner</span>
<span class="title">Similarity Search for Spatial Trajectories Using Online Lower Bounding DTW and Presorting Strategies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.18">10.4230/LIPIcs.TIME.2017.18</a>
</li>
<li>
<span class="authors">Michael Sioutis, Anastasia Paparrizou, and Jean-François Condotta</span>
<span class="title">Collective Singleton-Based Consistency for Qualitative Constraint Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.19">10.4230/LIPIcs.TIME.2017.19</a>
</li>
<li>
<span class="authors">Etienne Thuillier, Laurent Moalic, and Alexandre Caminada</span>
<span class="title">Dynamic Purpose Decomposition of Mobility Flows Based on Geographical Data</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.20">10.4230/LIPIcs.TIME.2017.20</a>
</li>
<li>
<span class="authors">Panagiotis Vasilikos, Flemming Nielson, and Hanne Riis Nielson</span>
<span class="title">Time Dependent Policy-Based Access Control</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.21">10.4230/LIPIcs.TIME.2017.21</a>
</li>
<li>
<span class="authors">Przemyslaw Andrzej Walega</span>
<span class="title">On Expressiveness of Halpern-Shoham Logic and its Horn Fragments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.22">10.4230/LIPIcs.TIME.2017.22</a>
</li>
<li>
<span class="authors">Matteo Zavatteri</span>
<span class="title">Conditional Simple Temporal Networks with Uncertainty and Decisions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2017.23">10.4230/LIPIcs.TIME.2017.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