<h2>LIPIcs, Volume 62, CSL 2016</h2>
<ul>
<li>
<span class="authors">Jean-Marc Talbot and Laurent Regnier</span>
<span class="title">LIPIcs, Volume 62, CSL'16, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016">10.4230/LIPIcs.CSL.2016</a>
</li>
<li>
<span class="authors">Jean-Marc Talbot and Laurent Regnier</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.0">10.4230/LIPIcs.CSL.2016.0</a>
</li>
<li>
<span class="authors">Thierry Coquand and Anuj Dawar</span>
<span class="title">The Ackermann Award 2016</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.1">10.4230/LIPIcs.CSL.2016.1</a>
</li>
<li>
<span class="authors">Libor Barto</span>
<span class="title">Infinite Domain Constraint Satisfaction Problem (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.2">10.4230/LIPIcs.CSL.2016.2</a>
</li>
<li>
<span class="authors">Anca Muscholl</span>
<span class="title">Automated Synthesis: Going Distributed (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.3">10.4230/LIPIcs.CSL.2016.3</a>
</li>
<li>
<span class="authors">Agata Ciabattoni</span>
<span class="title">Analytic Calculi for Non-Classical Logics: Theory and Applications (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.4">10.4230/LIPIcs.CSL.2016.4</a>
</li>
<li>
<span class="authors">Alexandra Silva</span>
<span class="title">Coalgebraic Learning (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.5">10.4230/LIPIcs.CSL.2016.5</a>
</li>
<li>
<span class="authors">Hans Leiss</span>
<span class="title">The Matrix Ring of a mu-Continuous Chomsky Algebra is mu-Continuous</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.6">10.4230/LIPIcs.CSL.2016.6</a>
</li>
<li>
<span class="authors">Sebastian Enqvist, Fatemeh Seifan, and Yde Venema</span>
<span class="title">Completeness for Coalgebraic Fixpoint Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.7">10.4230/LIPIcs.CSL.2016.7</a>
</li>
<li>
<span class="authors">Akihisa Yamada, Christian Sternagel, René Thiemann, and Keiichirou Kusakari</span>
<span class="title">AC Dependency Pairs Revisited</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.8">10.4230/LIPIcs.CSL.2016.8</a>
</li>
<li>
<span class="authors">Jérémy Dubut, Eric Goubault, and Jean Goubault-Larrecq</span>
<span class="title">The Directed Homotopy Hypothesis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.9">10.4230/LIPIcs.CSL.2016.9</a>
</li>
<li>
<span class="authors">Paulo Tabuada and Daniel Neider</span>
<span class="title">Robust Linear Temporal Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.10">10.4230/LIPIcs.CSL.2016.10</a>
</li>
<li>
<span class="authors">Pawel Parys and Szymon Torunczyk</span>
<span class="title">Models of Lambda-Calculus and the Weak MSO Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.11">10.4230/LIPIcs.CSL.2016.11</a>
</li>
<li>
<span class="authors">Moses Ganardi, Stefan Göller, and Markus Lohrey</span>
<span class="title">On the Parallel Complexity of Bisimulation on Finite Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.12">10.4230/LIPIcs.CSL.2016.12</a>
</li>
<li>
<span class="authors">Tomer Kotek, Helmut Veith, and Florian Zuleger</span>
<span class="title">Monadic Second Order Finite Satisfiability and Unbounded Tree-Width</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.13">10.4230/LIPIcs.CSL.2016.13</a>
</li>
<li>
<span class="authors">Lauri Hella and Phokion G. Kolaitis</span>
<span class="title">Dependence Logic vs. Constraint Satisfaction</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.14">10.4230/LIPIcs.CSL.2016.14</a>
</li>
<li>
<span class="authors">Hubie Chen and Peter Mayr</span>
<span class="title">Quantified Constraint Satisfaction on Monoids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.15">10.4230/LIPIcs.CSL.2016.15</a>
</li>
<li>
<span class="authors">Albert Atserias and Szymon Torunczyk</span>
<span class="title">Non-Homogenizable Classes of Finite Structures</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.16">10.4230/LIPIcs.CSL.2016.16</a>
</li>
<li>
<span class="authors">Michael Elberfeld</span>
<span class="title">Context-Free Graph Properties via Definable Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.17">10.4230/LIPIcs.CSL.2016.17</a>
</li>
<li>
<span class="authors">Kord Eickmeyer and Ken-ichi Kawarabayashi</span>
<span class="title">Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.18">10.4230/LIPIcs.CSL.2016.18</a>
</li>
<li>
<span class="authors">Wied Pakusa, Svenja Schalthöfer, and Erkal Selman</span>
<span class="title">Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.19">10.4230/LIPIcs.CSL.2016.19</a>
</li>
<li>
<span class="authors">Arnaud Durand, Anselm Haak, Juha Kontinen, and Heribert Vollmer</span>
<span class="title">Descriptive Complexity of #AC^0 Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.20">10.4230/LIPIcs.CSL.2016.20</a>
</li>
<li>
<span class="authors">Thorsten Altenkirch, Paolo Capriotti, and Nicolai Kraus</span>
<span class="title">Extending Homotopy Type Theory with Strict Equality</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.21">10.4230/LIPIcs.CSL.2016.21</a>
</li>
<li>
<span class="authors">Kuen-Bang Hou (Favonia) and Michael Shulman</span>
<span class="title">The Seifert-van Kampen Theorem in Homotopy Type Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.22">10.4230/LIPIcs.CSL.2016.22</a>
</li>
<li>
<span class="authors">Lars Birkedal, Aleš Bizjak, Ranald Clouston, Hans Bugge Grathwohl, Bas Spitters, and Andrea Vezzosi</span>
<span class="title">Guarded Cubical Type Theory: Path Equality for Guarded Recursion</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.23">10.4230/LIPIcs.CSL.2016.23</a>
</li>
<li>
<span class="authors">Ian Orton and Andrew M. Pitts</span>
<span class="title">Axioms for Modelling Cubical Type Theory in a Topos</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.24">10.4230/LIPIcs.CSL.2016.24</a>
</li>
<li>
<span class="authors">Jean-Louis Krivine</span>
<span class="title">Bar Recursion in Classical Realisability: Dependent Choice and Continuum Hypothesis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.25">10.4230/LIPIcs.CSL.2016.25</a>
</li>
<li>
<span class="authors">Ulrich Berger</span>
<span class="title">Extracting Non-Deterministic Concurrent Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.26">10.4230/LIPIcs.CSL.2016.26</a>
</li>
<li>
<span class="authors">James Laird</span>
<span class="title">Polymorphic Game Semantics for Dynamic Binding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.27">10.4230/LIPIcs.CSL.2016.27</a>
</li>
<li>
<span class="authors">Shaull Almagor and Orna Kupferman</span>
<span class="title">High-Quality Synthesis Against Stochastic Environments</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.28">10.4230/LIPIcs.CSL.2016.28</a>
</li>
<li>
<span class="authors">Rajeev Alur, Marco Faella, Sampath Kannan, and Nimit Singhania</span>
<span class="title">Hedging Bets in Markov Decision Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.29">10.4230/LIPIcs.CSL.2016.29</a>
</li>
<li>
<span class="authors">Paul Hunter, Guillermo A. Pérez, and Jean-François Raskin</span>
<span class="title">Minimizing Regret in Discounted-Sum Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.30">10.4230/LIPIcs.CSL.2016.30</a>
</li>
<li>
<span class="authors">Alexander Weinert and Martin Zimmermann</span>
<span class="title">Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.31">10.4230/LIPIcs.CSL.2016.31</a>
</li>
<li>
<span class="authors">David Baelde, Simon Lunel, and Sylvain Schmitz</span>
<span class="title">A Sequent Calculus for a Modal Logic on Finite Data Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.32">10.4230/LIPIcs.CSL.2016.32</a>
</li>
<li>
<span class="authors">Martin Lück</span>
<span class="title">Axiomatizations for Propositional and Modal Team Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.33">10.4230/LIPIcs.CSL.2016.33</a>
</li>
<li>
<span class="authors">Gergei Bana and Mitsuhiro Okada</span>
<span class="title">Semantics for "Enough-Certainty" and Fitting's Embedding of Classical Logic in S4</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.34">10.4230/LIPIcs.CSL.2016.34</a>
</li>
<li>
<span class="authors">Erich Grädel and Stefan Hegselmann</span>
<span class="title">Counting in Team Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.35">10.4230/LIPIcs.CSL.2016.35</a>
</li>
<li>
<span class="authors">Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Pierre Pradic, and Michal Skrzypczak</span>
<span class="title">The Logical Strength of Büchi's Decidability Theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.36">10.4230/LIPIcs.CSL.2016.36</a>
</li>
<li>
<span class="authors">Prateek Karandikar and Philippe Schnoebelen</span>
<span class="title">The Height of Piecewise-Testable Languages with Applications in Logical Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.37">10.4230/LIPIcs.CSL.2016.37</a>
</li>
<li>
<span class="authors">Emanuel Kieronski</span>
<span class="title">One-Dimensional Logic over Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.38">10.4230/LIPIcs.CSL.2016.38</a>
</li>
<li>
<span class="authors">Ian Pratt-Hartmann, Wieslaw Szwast, and Lidia Tendera</span>
<span class="title">Quine's Fluted Fragment is Non-Elementary</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.39">10.4230/LIPIcs.CSL.2016.39</a>
</li>
<li>
<span class="authors">Patrick Baillot and Anupam Das</span>
<span class="title">Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.40">10.4230/LIPIcs.CSL.2016.40</a>
</li>
<li>
<span class="authors">Daniel de Carvalho</span>
<span class="title">The Relational Model Is Injective for Multiplicative Exponential Linear Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.41">10.4230/LIPIcs.CSL.2016.41</a>
</li>
<li>
<span class="authors">David Baelde, Amina Doumane, and Alexis Saurin</span>
<span class="title">Infinitary Proof Theory: the Multiplicative Additive Case</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2016.42">10.4230/LIPIcs.CSL.2016.42</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