default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCSL 2016: Marseille, France
- Jean-Marc Talbot, Laurent Regnier:
25th EACSL Annual Conference on Computer Science Logic, CSL 2016, August 29 - September 1, 2016, Marseille, France. LIPIcs 62, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-022-4 - Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers. 0:i-0:xvi
- Thierry Coquand, Anuj Dawar:
The Ackermann Award 2016. 1:1-1:4
Invited Talks
- Libor Barto:
Infinite Domain Constraint Satisfaction Problem. 2:1-2:1 - Anca Muscholl:
Automated Synthesis: Going Distributed. 3:1-3:2 - Agata Ciabattoni
:
Analytic Calculi for Non-Classical Logics: Theory and Applications. 4:1-4:1 - Alexandra Silva:
Coalgebraic Learning. 5:1-5:1
Contributed Talks
- Hans Leiss:
The Matrix Ring of a μ-Continuous Chomsky Algebra is mu-Continuous. 6:1-6:15 - Sebastian Enqvist, Fatemeh Seifan, Yde Venema:
Completeness for Coalgebraic Fixpoint Logic. 7:1-7:19 - Akihisa Yamada, Christian Sternagel, René Thiemann, Keiichirou Kusakari:
AC Dependency Pairs Revisited. 8:1-8:16 - Jérémy Dubut, Eric Goubault, Jean Goubault-Larrecq:
The Directed Homotopy Hypothesis. 9:1-9:16 - Paulo Tabuada, Daniel Neider:
Robust Linear Temporal Logic. 10:1-10:21 - Pawel Parys, Szymon Torunczyk:
Models of Lambda-Calculus and the Weak MSO Logic. 11:1-11:12 - Moses Ganardi, Stefan Göller, Markus Lohrey:
On the Parallel Complexity of Bisimulation on Finite Systems. 12:1-12:17 - Tomer Kotek, Helmut Veith, Florian Zuleger:
Monadic Second Order Finite Satisfiability and Unbounded Tree-Width. 13:1-13:20 - Lauri Hella, Phokion G. Kolaitis:
Dependence Logic vs. Constraint Satisfaction. 14:1-14:17 - Hubie Chen, Peter Mayr:
Quantified Constraint Satisfaction on Monoids. 15:1-15:14 - Albert Atserias, Szymon Torunczyk:
Non-Homogenizable Classes of Finite Structures. 16:1-16:16 - Michael Elberfeld:
Context-Free Graph Properties via Definable Decompositions. 17:1-17:16 - Kord Eickmeyer, Ken-ichi Kawarabayashi:
Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs. 18:1-18:15 - Wied Pakusa, Svenja Schalthöfer, Erkal Selman:
Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time. 19:1-19:17 - Arnaud Durand, Anselm Haak, Juha Kontinen, Heribert Vollmer:
Descriptive Complexity of #AC0 Functions. 20:1-20:16 - Thorsten Altenkirch, Paolo Capriotti, Nicolai Kraus:
Extending Homotopy Type Theory with Strict Equality. 21:1-21:17 - Kuen-Bang Hou (Favonia), Michael Shulman:
The Seifert-van Kampen Theorem in Homotopy Type Theory. 22:1-22:16 - Lars Birkedal, Ales Bizjak, Ranald Clouston, Hans Bugge Grathwohl, Bas Spitters, Andrea Vezzosi:
Guarded Cubical Type Theory: Path Equality for Guarded Recursion. 23:1-23:17 - Ian Orton, Andrew M. Pitts:
Axioms for Modelling Cubical Type Theory in a Topos. 24:1-24:19 - Jean-Louis Krivine:
Bar Recursion in Classical Realisability: Dependent Choice and Continuum Hypothesis. 25:1-25:11 - Ulrich Berger:
Extracting Non-Deterministic Concurrent Programs. 26:1-26:21 - James Laird:
Polymorphic Game Semantics for Dynamic Binding. 27:1-27:16 - Shaull Almagor, Orna Kupferman:
High-Quality Synthesis Against Stochastic Environments. 28:1-28:17 - Rajeev Alur, Marco Faella, Sampath Kannan, Nimit Singhania:
Hedging Bets in Markov Decision Processes. 29:1-29:20 - Paul Hunter, Guillermo A. Pérez, Jean-François Raskin:
Minimizing Regret in Discounted-Sum Games. 30:1-30:17 - Alexander Weinert, Martin Zimmermann:
Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs. 31:1-31:17 - David Baelde, Simon Lunel, Sylvain Schmitz:
A Sequent Calculus for a Modal Logic on Finite Data Trees. 32:1-32:16 - Martin Lück:
Axiomatizations for Propositional and Modal Team Logic. 33:1-33:18 - Gergei Bana, Mitsuhiro Okada:
Semantics for "Enough-Certainty" and Fitting's Embedding of Classical Logic in S4. 34:1-34:18 - Erich Grädel, Stefan Hegselmann:
Counting in Team Semantics. 35:1-35:18 - Leszek Aleksander Kolodziejczyk, Henryk Michalewski, Cécilia Pradic, Michal Skrzypczak:
The Logical Strength of Büchi's Decidability Theorem. 36:1-36:16 - Prateek Karandikar, Philippe Schnoebelen:
The Height of Piecewise-Testable Languages with Applications in Logical Complexity. 37:1-37:22 - Emanuel Kieronski:
One-Dimensional Logic over Words. 38:1-38:15 - Ian Pratt-Hartmann, Wieslaw Szwast, Lidia Tendera:
Quine's Fluted Fragment is Non-Elementary. 39:1-39:21 - Patrick Baillot, Anupam Das:
Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic. 40:1-40:18 - Daniel de Carvalho:
The Relational Model Is Injective for Multiplicative Exponential Linear Logic. 41:1-41:19 - David Baelde, Amina Doumane, Alexis Saurin:
Infinitary Proof Theory: the Multiplicative Additive Case. 42:1-42:17
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-06-21 00:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
