Jean-Marc Talbot, Laurent Regnier
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic
CSL, 2016.

@proceedings{CSL-2016,
	editor        = "Jean-Marc Talbot and Laurent Regnier",
	ee            = "http://www.dagstuhl.de/dagpub/978-3-95977-022-4",
	isbn          = "978-3-95977-022-4",
	publisher     = "{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}",
	series        = "{Leibniz International Proceedings in Informatics}",
	title         = "{Proceedings of the 25th EACSL Annual Conference on Computer Science Logic}",
	volume        = 62,
	year          = 2016,
}

Contents (42 items)

CSL-2016-Barto #constraints #infinity #problem

Infinite Domain Constraint Satisfaction Problem (LB), p. 1.

CSL-2016-Ciabattoni #calculus #logic #theory and practice

Analytic Calculi for Non-Classical Logics: Theory and Applications (AC), p. 1.

CSL-2016-Silva #algebra #learning

Coalgebraic Learning (AS0), p. 1.

CSL-2016-Muscholl #automation #distributed #synthesis

Automated Synthesis: Going Distributed (AM), p. 2.

CSL-2016-CoquandD

The Ackermann Award 2016 (TC, AD), p. 4.

CSL-2016-Krivine #recursion

Bar Recursion in Classical Realisability: Dependent Choice and Continuum Hypothesis (JLK), p. 11.

CSL-2016-ParysT #logic #modelling #λ-calculus

Models of Lambda-Calculus and the Weak MSO Logic (PP, ST), p. 12.

CSL-2016-ChenM #constraints #monad #quantifier

Quantified Constraint Satisfaction on Monoids (HC, PM), p. 14.

CSL-2016-EickmeyerK #first-order #graph #invariant #logic

Successor-Invariant First-Order Logic on Graphs with Excluded Topological Subgraphs (KE, KiK), p. 15.

CSL-2016-Kieronski #logic #word

One-Dimensional Logic over Words (EK), p. 15.

CSL-2016-Leiss #algebra #matrix

The Matrix Ring of a μ-Continuous Chomsky Algebra is mu-Continuous (HL), p. 15.

CSL-2016-0001HKV #complexity

Descriptive Complexity of #AC0 Functions (AD0, AH, JK, HV), p. 16.

CSL-2016-0002STK #dependence #revisited

AC Dependency Pairs Revisited (AY0, CS, RT, KK), p. 16.

CSL-2016-AtseriasT #finite

Non-Homogenizable Classes of Finite Structures (AA, ST), p. 16.

CSL-2016-BaeldeLS #calculus #finite #logic

A Sequent Calculus for a Modal Logic on Finite Data Trees (DB, SL, SS), p. 16.

CSL-2016-DubutGG

The Directed Homotopy Hypothesis (JD, EG, JGL), p. 16.

CSL-2016-Elberfeld #graph

Context-Free Graph Properties via Definable Decompositions (ME), p. 16.

CSL-2016-FavoniaS #theorem #type system

The Seifert-van Kampen Theorem in Homotopy Type Theory (KBH(, MS), p. 16.

CSL-2016-KolodziejczykMP #automaton #decidability #logic #theorem

The Logical Strength of Büchi's Decidability Theorem (LAK, HM, PP, MS), p. 16.

CSL-2016-Laird #game studies #polymorphism #semantics

Polymorphic Game Semantics for Dynamic Binding (JL), p. 16.

CSL-2016-AlmagorK #probability #synthesis

High-Quality Synthesis Against Stochastic Environments (SA, OK), p. 17.

CSL-2016-AltenkirchCK #similarity #strict #type system

Extending Homotopy Type Theory with Strict Equality (TA, PC, NK), p. 17.

CSL-2016-BaeldeDS #multi #proving

Infinitary Proof Theory: the Multiplicative Additive Case (DB, AD, AS), p. 17.

CSL-2016-BirkedalBCGSV #recursion #similarity #type system

Guarded Cubical Type Theory: Path Equality for Guarded Recursion (LB, AB, RC, HBG, BS, AV), p. 17.

CSL-2016-GanardiGL #bisimulation #complexity #finite #on the #parallel

On the Parallel Complexity of Bisimulation on Finite Systems (MG, SG, ML), p. 17.

CSL-2016-HellaK #constraints #dependence #logic

Dependence Logic vs. Constraint Satisfaction (LH, PGK), p. 17.

CSL-2016-HunterPR #game studies

Minimizing Regret in Discounted-Sum Games (PH, GAP, JFR), p. 17.

CSL-2016-PakusaSS #polynomial #problem

Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time (WP, SS, ES), p. 17.

CSL-2016-Weinert0 #game studies

Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs (AW, MZ0), p. 17.

CSL-2016-BaillotD #linear #logic

Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic (PB, AD0), p. 18.

CSL-2016-BanaO #logic #semantics

Semantics for “Enough-Certainty” and Fitting's Embedding of Classical Logic in S4 (GB, MO), p. 18.

CSL-2016-GradelH #semantics

Counting in Team Semantics (EG, SH), p. 18.

CSL-2016-Luck #axiom #logic

Axiomatizations for Propositional and Modal Team Logic (ML), p. 18.

CSL-2016-Carvalho #exponential #injection #linear #logic #multi #relational

The Relational Model Is Injective for Multiplicative Exponential Linear Logic (DdC), p. 19.

CSL-2016-EnqvistSV #algebra #fixpoint #logic

Completeness for Coalgebraic Fixpoint Logic (SE, FS, YV), p. 19.

CSL-2016-OrtonP #axiom #modelling #type system

Axioms for Modelling Cubical Type Theory in a Topos (IO, AMP), p. 19.

CSL-2016-AlurFKS #markov #process

Hedging Bets in Markov Decision Processes (RA, MF, SK, NS), p. 20.

CSL-2016-KotekVZ #bound #finite #higher-order #monad #satisfiability

Monadic Second Order Finite Satisfiability and Unbounded Tree-Width (TK, HV, FZ), p. 20.

CSL-2016-Berger #concurrent #nondeterminism #source code

Extracting Non-Deterministic Concurrent Programs (UB0), p. 21.

CSL-2016-Pratt-HartmannS

Quine's Fluted Fragment is Non-Elementary (IPH, WS, LT), p. 21.

CSL-2016-TabuadaN #linear #logic #robust

Robust Linear Temporal Logic (PT, DN), p. 21.

CSL-2016-KarandikarS #complexity #logic

The Height of Piecewise-Testable Languages with Applications in Logical Complexity (PK, PS), p. 22.