<h2>LIPIcs, Volume 178, TIME 2020</h2>
<ul>
<li>
<span class="authors">Emilio Muñoz-Velasco, Ana Ozaki, and Martin Theobald</span>
<span class="title">LIPIcs, Volume 178, TIME 2020, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020">10.4230/LIPIcs.TIME.2020</a>
</li>
<li>
<span class="authors">Emilio Muñoz-Velasco, Ana Ozaki, and Martin Theobald</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.0">10.4230/LIPIcs.TIME.2020.0</a>
</li>
<li>
<span class="authors">Clare Dixon</span>
<span class="title">Verifying Autonomous Robots: Challenges and Reflections (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.1">10.4230/LIPIcs.TIME.2020.1</a>
</li>
<li>
<span class="authors">Pedro Cabalar</span>
<span class="title">Temporal Modalities in Answer Set Programming (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.2">10.4230/LIPIcs.TIME.2020.2</a>
</li>
<li>
<span class="authors">Johann Eder and Marco Franceschetti</span>
<span class="title">Time and Business Process Management: Problems, Achievements, Challenges (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.3">10.4230/LIPIcs.TIME.2020.3</a>
</li>
<li>
<span class="authors">Marco Franceschetti and Johann Eder</span>
<span class="title">Negotiating Temporal Commitments in Cross-Organizational Business Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.4">10.4230/LIPIcs.TIME.2020.4</a>
</li>
<li>
<span class="authors">Alessandro Bertagnon, Marco Gavanelli, Alessandro Passantino, Guido Sciavicco, and Stefano Trevisani</span>
<span class="title">The Horn Fragment of Branching Algebra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.5">10.4230/LIPIcs.TIME.2020.5</a>
</li>
<li>
<span class="authors">Florian Bruse and Martin Lange</span>
<span class="title">Temporal Logic with Recursion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.6">10.4230/LIPIcs.TIME.2020.6</a>
</li>
<li>
<span class="authors">Catalin-Andrei Ilie and James Ben Worrell</span>
<span class="title">Parametric Model Checking Continuous-Time Markov Chains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.7">10.4230/LIPIcs.TIME.2020.7</a>
</li>
<li>
<span class="authors">Zehui Cheng and Phokion G. Kolaitis</span>
<span class="title">Universal Solutions in Temporal Data Exchange</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.8">10.4230/LIPIcs.TIME.2020.8</a>
</li>
<li>
<span class="authors">Guido Sciavicco and Ionel Eduard Stan</span>
<span class="title">Knowledge Extraction with Interval Temporal Logic Decision Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.9">10.4230/LIPIcs.TIME.2020.9</a>
</li>
<li>
<span class="authors">Aurélie Suzanne, Guillaume Raschia, José Martinez, and Damien Tassetti</span>
<span class="title">Window-Slicing Techniques Extended to Spanning-Event Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.10">10.4230/LIPIcs.TIME.2020.10</a>
</li>
<li>
<span class="authors">Guido Sciavicco, Matteo Zavatteri, and Tiziano Villa</span>
<span class="title">Mining Significant Temporal Networks Is Polynomial</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.11">10.4230/LIPIcs.TIME.2020.11</a>
</li>
<li>
<span class="authors">Michael Sioutis and Diedrich Wolter</span>
<span class="title">Dynamic Branching in Qualitative Constraint Networks via Counting Local Models</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.12">10.4230/LIPIcs.TIME.2020.12</a>
</li>
<li>
<span class="authors">Jean Guyomarc'h, François Guerret, Bilal El Mejjati, Emmanuel Ohayon, Bastien Vincke, and Alain Mérigot</span>
<span class="title">Non-Simultaneity as a Design Constraint</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.13">10.4230/LIPIcs.TIME.2020.13</a>
</li>
<li>
<span class="authors">Alex Abuin, Alexander Bolotov, Montserrat Hermo, and Paqui Lucio</span>
<span class="title">One-Pass Context-Based Tableaux Systems for CTL and ECTL</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.14">10.4230/LIPIcs.TIME.2020.14</a>
</li>
<li>
<span class="authors">Hai Nguyen Van, Frédéric Boulanger, and Burkhart Wolff</span>
<span class="title">TESL: A Model with Metric Time for Modeling and Simulation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.15">10.4230/LIPIcs.TIME.2020.15</a>
</li>
<li>
<span class="authors">Dario Della Monica, Nicola Gigante, Salvatore La Torre, and Angelo Montanari</span>
<span class="title">Complexity of Qualitative Timeline-Based Planning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.16">10.4230/LIPIcs.TIME.2020.16</a>
</li>
<li>
<span class="authors">Bartosz Bednarczyk and Piotr Witkowski</span>
<span class="title">A Note on C² Interpreted over Finite Data-Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.17">10.4230/LIPIcs.TIME.2020.17</a>
</li>
<li>
<span class="authors">Jelle Hellings and Yuqing Wu</span>
<span class="title">Stab-Forests: Dynamic Data Structures for Efficient Temporal Query Processing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.18">10.4230/LIPIcs.TIME.2020.18</a>
</li>
<li>
<span class="authors">Anasse Chafik, Fahima Cheikh-Alili, Jean-François Condotta, and Ivan Varzinczak</span>
<span class="title">On the Decidability of a Fragment of preferential LTL</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.TIME.2020.19">10.4230/LIPIcs.TIME.2020.19</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