Valentin Goranko, Mads Dam
Proceedings of the 26th EACSL Annual Conference on Computer Science Logic
CSL, 2017.

@proceedings{CSL-2017,
	editor        = "Valentin Goranko and Mads Dam",
	ee            = "http://www.dagstuhl.de/dagpub/978-3-95977-045-3",
	isbn          = "978-3-95977-045-3",
	publisher     = "{Schloss Dagstuhl - Leibniz-Zentrum für Informatik}",
	series        = "{Leibniz International Proceedings in Informatics}",
	title         = "{Proceedings of the 26th EACSL Annual Conference on Computer Science Logic}",
	volume        = 82,
	year          = 2017,
}

Contents (42 items)

CSL-2017-Kolaitis

Schema Mappings: Structural Properties and Limits (Invited Talk) (PGK), p. 1.

CSL-2017-Kovacs #first-order #proving

First-Order Interpolation and Grey Areas of Proofs (Invited Talk) (LK), p. 1.

CSL-2017-Mahajan #overview

Arithmetic Circuits: An Overview (Invited Talk) (MM), p. 1.

CSL-2017-Thomas #algorithm #approach #game studies #infinity

Determinacy of Infinite Games: Perspectives of the Algorithmic Approach (Invited Talk) (WT), p. 1.

CSL-2017-Veanes #automaton

Symbolic Automata Theory with Applications (Invited Talk) (MV), p. 3.

CSL-2017-DawarL

The Ackermann Award 2017 (AD, DL), p. 4.

CSL-2017-Kreutzer #first-order #model checking #roadmap

Current Trends and New Perspectives for First-Order Model Checking (Invited Talk) (SK), p. 5.

CSL-2017-Boudou #decidability #logic

Decidable Logics with Associative Binary Modalities (JB), p. 15.

CSL-2017-MuroyaG #call-by #geometry #graph grammar #interactive

The Dynamic Geometry of Interaction Machine: A Call-by-Need Graph Rewriter (KM, DRG), p. 15.

CSL-2017-Oliveira #on the

On Supergraphs Satisfying CMSO Properties (MdOO), p. 15.

CSL-2017-AhrensLV #category theory #type system

Categorical Structures for Type Theory in Univalent Foundations (BA, PLL, VV), p. 16.

CSL-2017-Boker #automaton #on the

On the (In)Succinctness of Muller Automata (UB), p. 16.

CSL-2017-CartonFL #automaton

Polishness of Some Topologies Related to Automata (OC, OF, DL), p. 16.

CSL-2017-ChenFH #bound #first-order #logic #quantifier #rank #slicing

Slicewise Definability in First-Order Logic with Bounded Quantifier Rank (YC, JF, XH), p. 16.

CSL-2017-EscardoK #recursion #type system

Partial Elements and Recursion via Dominances in Univalent Type Theory (MHE, CMK), p. 16.

CSL-2017-GhicaJL #diagrams #semantics

Diagrammatic Semantics for Digital Circuits (DRG, AJ, AL), p. 16.

CSL-2017-GouveiaS #calculus

Aleph1 and the Modal mu-Calculus (MJG, LS), p. 16.

CSL-2017-Vaux #normalisation

Taylor Expansion, lambda-Reduction and Normalization (LV), p. 16.

CSL-2017-VerbitskyZ #complexity #first-order #morphism #on the

On the First-Order Complexity of Induced Subgraph Isomorphism (OV, MZ), p. 16.

CSL-2017-BoudouDF #decidability #logic

A Decidable Intuitionistic Temporal Logic (JB, MD, DFD), p. 17.

CSL-2017-BrechtP

Noetherian Quasi-Polish spaces (MdB, AP), p. 17.

CSL-2017-BresolinMS #logic #performance #reasoning

Fast(er) Reasoning in Interval Temporal Logic (DB, EMV, GS), p. 17.

CSL-2017-CockettL #calculus #category theory

Integral Categories and Calculus Categories (JRBC, JSL), p. 17.

CSL-2017-GerardM #functional

Separating Functional Computation from Relations (UG, DM0), p. 17.

CSL-2017-Hannula #dependence #logic

Validity and Entailment in Modal and Propositional Dependence Logics (MH), p. 17.

CSL-2017-TubellaGR #proving

Removing Cycles from Proofs (AAT, AG, BR), p. 17.

CSL-2017-GradelPP #proving

The Model-Theoretic Expressiveness of Propositional Proof Systems (EG, BP, WP), p. 18.

CSL-2017-Grussien #graph #polynomial

Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs (BG), p. 19.

CSL-2017-BednarczykCK #logic

Extending Two-Variable Logic on Trees (BB, WC, EK), p. 20.

CSL-2017-BorlidoCGK #principle

Stone Duality and the Substitution Principle (CB, SC, MG, AK), p. 20.

CSL-2017-FokkinkG #composition #lookahead

Precongruence Formats with Lookahead through Modal Decomposition (WJF, RJvG), p. 20.

CSL-2017-HorcikMV #algebra #approach #constraints

An Algebraic Approach to Valued Constraint Satisfaction (RH, TM, AV), p. 20.

CSL-2017-Luck #logic #power of #semantics

The Power of the Filtration Technique for Modal Logics with Team Semantics (ML), p. 20.

CSL-2017-Pavaux #functional #induction

Inductive and Functional Types in Ludics (AP), p. 20.

CSL-2017-ZaidGR #automation

Advice Automatic Structures and Uniformly Automatic Classes (FAZ, EG, FR), p. 20.

CSL-2017-AngluinAF #learning #polynomial #query

Query Learning of Derived Omega-Tree Languages in Polynomial Time (DA, TA, DF), p. 21.

CSL-2017-ChatterjeeDHL #algorithm #game studies

Improved Set-Based Symbolic Algorithms for Parity Games (KC, WD, MH, VL), p. 21.

CSL-2017-KlinL #calculus

Modal mu-Calculus with Atoms (BK, ML), p. 21.

CSL-2017-RicciottiC #normalisation

Strongly Normalizing Audited Computation (WR, JC), p. 21.

CSL-2017-Sankaran

A Finitary Analogue of the Downward Löwenheim-Skolem Property (AS), p. 21.

CSL-2017-VismeW #parallel

Strategies with Parallel Causes (MdV, GW), p. 21.

CSL-2017-HeerdtS0 #automaton #category theory #framework #learning #named

CALF: Categorical Automata Learning Framework (GvH, MS, AS0), p. 24.