<h2>LIPIcs, Volume 16, CSL 2012</h2>
<ul>
<li>
<span class="authors">Patrick Cégielski and Arnaud Durand</span>
<span class="title">LIPIcs, Volume 16, CSL'12, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012">10.4230/LIPIcs.CSL.2012</a>
</li>
<li>
<span class="authors">Patrick Cégielski and Arnaud Durand</span>
<span class="title">Frontmatter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.i">10.4230/LIPIcs.CSL.2012.i</a>
</li>
<li>
<span class="authors">Thierry Coquand, Anuj Dawar, and Damian Niwinski</span>
<span class="title">The Ackermann Award 2012</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.1">10.4230/LIPIcs.CSL.2012.1</a>
</li>
<li>
<span class="authors">Serge Abiteboul</span>
<span class="title">Sharing Distributed Knowledge on the Web (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.6">10.4230/LIPIcs.CSL.2012.6</a>
</li>
<li>
<span class="authors">Stephen A. Cook</span>
<span class="title">Connecting Complexity Classes, Weak Formal Theories, and Propositional Proof Systems (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.9">10.4230/LIPIcs.CSL.2012.9</a>
</li>
<li>
<span class="authors">Inês Lynce</span>
<span class="title">Satisfiability: where Theory meets Practice (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.12">10.4230/LIPIcs.CSL.2012.12</a>
</li>
<li>
<span class="authors">Johann A. Makowsky</span>
<span class="title">Definability and Complexity of Graph Parameters (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.14">10.4230/LIPIcs.CSL.2012.14</a>
</li>
<li>
<span class="authors">Thorsten Altenkirch and Ondrej Rypacek</span>
<span class="title">A Syntactical Approach to Weak omega-Groupoids</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.16">10.4230/LIPIcs.CSL.2012.16</a>
</li>
<li>
<span class="authors">Federico Aschieri</span>
<span class="title">Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.31">10.4230/LIPIcs.CSL.2012.31</a>
</li>
<li>
<span class="authors">Robert Atkey</span>
<span class="title">Relational Parametricity for Higher Kinds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.46">10.4230/LIPIcs.CSL.2012.46</a>
</li>
<li>
<span class="authors">Patrick Baillot and Ugo Dal Lago</span>
<span class="title">Higher-Order Interpretations and Program Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.62">10.4230/LIPIcs.CSL.2012.62</a>
</li>
<li>
<span class="authors">Stefano Berardi and Ugo de'Liguoro</span>
<span class="title">Knowledge Spaces and the Completeness of Learning Strategies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.77">10.4230/LIPIcs.CSL.2012.77</a>
</li>
<li>
<span class="authors">Nathalie Bertrand, John Fearnley, and Sven Schewe</span>
<span class="title">Bounded Satisfiability for PCTL</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.92">10.4230/LIPIcs.CSL.2012.92</a>
</li>
<li>
<span class="authors">Lars Birkedal, Filip Sieczkowski, and Jacob Thamsborg</span>
<span class="title">A Concurrent Logical Relation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.107">10.4230/LIPIcs.CSL.2012.107</a>
</li>
<li>
<span class="authors">Manuel Bodirsky and Michal Wrona</span>
<span class="title">Equivalence Constraint Satisfaction Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.122">10.4230/LIPIcs.CSL.2012.122</a>
</li>
<li>
<span class="authors">Johann Brault-Baron</span>
<span class="title">A Negative Conjunctive Query is Easy if and only if it is Beta-Acyclic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.137">10.4230/LIPIcs.CSL.2012.137</a>
</li>
<li>
<span class="authors">Alberto Carraro and Antonino Salibra</span>
<span class="title">On the equational consistency of order-theoretic models of the lambda-calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.152">10.4230/LIPIcs.CSL.2012.152</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee, Siddhesh Chaubal, and Pritish Kamath</span>
<span class="title">Faster Algorithms for Alternating Refinement Relations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.167">10.4230/LIPIcs.CSL.2012.167</a>
</li>
<li>
<span class="authors">Kaustuv Chaudhuri, Stefan Hetzl, and Dale Miller</span>
<span class="title">A Systematic Approach to Canonicity in the Classical Sequent Calculus</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.183">10.4230/LIPIcs.CSL.2012.183</a>
</li>
<li>
<span class="authors">Jacek Chrzaszcz and Aleksy Schubert</span>
<span class="title">ML with PTIME complexity guarantees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.198">10.4230/LIPIcs.CSL.2012.198</a>
</li>
<li>
<span class="authors">Anuj Dawar, Erich Grädel, Bjarki Holm, Eryk Kopczynski, and Wied Pakusa</span>
<span class="title">Definability of linear equation systems over groups and rings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.213">10.4230/LIPIcs.CSL.2012.213</a>
</li>
<li>
<span class="authors">Henry DeYoung, Luís Caires, Frank Pfenning, and Bernardo Toninho</span>
<span class="title">Cut Reduction in Linear Logic as Asynchronous Session-Typed Communication</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.228">10.4230/LIPIcs.CSL.2012.228</a>
</li>
<li>
<span class="authors">Boris Düdder, Moritz Martens, Jakob Rehof, and Pawel Urzyczyn</span>
<span class="title">Bounded Combinatory Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.243">10.4230/LIPIcs.CSL.2012.243</a>
</li>
<li>
<span class="authors">Thomas Ehrhard</span>
<span class="title">Collapsing non-idempotent intersection types</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.259">10.4230/LIPIcs.CSL.2012.259</a>
</li>
<li>
<span class="authors">Etienne Grandjean and Frédéric Olive</span>
<span class="title">Descriptive complexity for pictures languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.274">10.4230/LIPIcs.CSL.2012.274</a>
</li>
<li>
<span class="authors">Martin Grohe and Martin Otto</span>
<span class="title">Pebble Games and Linear Equations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.289">10.4230/LIPIcs.CSL.2012.289</a>
</li>
<li>
<span class="authors">Erich Grädel and Simon Leßenich</span>
<span class="title">Banach-Mazur Games with Simple Winning Strategies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.305">10.4230/LIPIcs.CSL.2012.305</a>
</li>
<li>
<span class="authors">Stefan Hetzl and Lutz Straßburger</span>
<span class="title">Herbrand-Confluence for Cut Elimination in Classical First Order Logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.320">10.4230/LIPIcs.CSL.2012.320</a>
</li>
<li>
<span class="authors">Takanori Hida</span>
<span class="title">A Computational Interpretation of the Axiom of Determinacy in Arithmetic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.335">10.4230/LIPIcs.CSL.2012.335</a>
</li>
<li>
<span class="authors">Jean-Pierre Jouannaud and Jianqi Li</span>
<span class="title">Church-Rosser Properties of Normal Rewriting</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.350">10.4230/LIPIcs.CSL.2012.350</a>
</li>
<li>
<span class="authors">Lukasz Kaiser and Simon Leßenich</span>
<span class="title">A Counting Logic for Structure Transition Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.366">10.4230/LIPIcs.CSL.2012.366</a>
</li>
<li>
<span class="authors">Chantal Keller and Marc Lasson</span>
<span class="title">Parametricity in an Impredicative Sort</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.381">10.4230/LIPIcs.CSL.2012.381</a>
</li>
<li>
<span class="authors">Emanuel Kieronski and Jakub Michaliszyn</span>
<span class="title">Two-Variable Universal Logic with Transitive Closure</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.396">10.4230/LIPIcs.CSL.2012.396</a>
</li>
<li>
<span class="authors">Tomer Kotek and Johann A. Makowsky</span>
<span class="title">Connection Matrices and the Definability of Graph Parameters</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.411">10.4230/LIPIcs.CSL.2012.411</a>
</li>
<li>
<span class="authors">Manfred Kufleitner and Pascal Weil</span>
<span class="title">The FO2 alternation hierarchy is decidable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.426">10.4230/LIPIcs.CSL.2012.426</a>
</li>
<li>
<span class="authors">Satoru Kuroda</span>
<span class="title">Axiomatizing proof tree concepts in Bounded Arithmetic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.440">10.4230/LIPIcs.CSL.2012.440</a>
</li>
<li>
<span class="authors">Dietrich Kuske</span>
<span class="title">Isomorphisms of scattered automatic linear orders</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.455">10.4230/LIPIcs.CSL.2012.455</a>
</li>
<li>
<span class="authors">Antti Kuusisto, Jeremy Meyers, and Jonni Virtema</span>
<span class="title">Undecidable First-Order Theories of Affine Geometries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.470">10.4230/LIPIcs.CSL.2012.470</a>
</li>
<li>
<span class="authors">Alexander Leitsch, Giselle Reis, and Bruno Woltzenlogel Paleo</span>
<span class="title">Towards CERes in intuitionistic logic</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.485">10.4230/LIPIcs.CSL.2012.485</a>
</li>
<li>
<span class="authors">Pawel Parys</span>
<span class="title">Variants of Collapsible Pushdown Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.500">10.4230/LIPIcs.CSL.2012.500</a>
</li>
<li>
<span class="authors">Alexander Rabinovich</span>
<span class="title">A Proof of Kamp's theorem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.516">10.4230/LIPIcs.CSL.2012.516</a>
</li>
<li>
<span class="authors">Zhilin Wu</span>
<span class="title">Commutative Data Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.CSL.2012.528">10.4230/LIPIcs.CSL.2012.528</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