LIPIcs, Volume 82, CSL 2017

• Valentin Goranko and Mads Dam LIPIcs, Volume 82, CSL'17, Complete Volume 10.4230/LIPIcs.CSL.2017
• Valentin Goranko and Mads Dam Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers 10.4230/LIPIcs.CSL.2017.0
• Anuj Dawar and Daniel Leivant The Ackermann Award 2017 10.4230/LIPIcs.CSL.2017.1
• Phokion G. Kolaitis Schema Mappings: Structural Properties and Limits (Invited Talk) 10.4230/LIPIcs.CSL.2017.2
• Laura Kovács First-Order Interpolation and Grey Areas of Proofs (Invited Talk) 10.4230/LIPIcs.CSL.2017.3
• Stephan Kreutzer Current Trends and New Perspectives for First-Order Model Checking (Invited Talk) 10.4230/LIPIcs.CSL.2017.4
• Meena Mahajan Arithmetic Circuits: An Overview (Invited Talk) 10.4230/LIPIcs.CSL.2017.5
• Wolfgang Thomas Determinacy of Infinite Games: Perspectives of the Algorithmic Approach (Invited Talk) 10.4230/LIPIcs.CSL.2017.6
• Margus Veanes Symbolic Automata Theory with Applications (Invited Talk) 10.4230/LIPIcs.CSL.2017.7
• Benedikt Ahrens, Peter LeFanu Lumsdaine, and Vladimir Voevodsky Categorical Structures for Type Theory in Univalent Foundations 10.4230/LIPIcs.CSL.2017.8
• Andrea Aler Tubella, Alessio Guglielmi, and Benjamin Ralph Removing Cycles from Proofs 10.4230/LIPIcs.CSL.2017.9
• Dana Angluin, Timos Antonopoulos, and Dana Fisman Query Learning of Derived Omega-Tree Languages in Polynomial Time 10.4230/LIPIcs.CSL.2017.10
• Bartosz Bednarczyk, Witold Charatonik, and Emanuel Kieronski Extending Two-Variable Logic on Trees 10.4230/LIPIcs.CSL.2017.11
• Udi Boker On the (In)Succinctness of Muller Automata 10.4230/LIPIcs.CSL.2017.12
• Célia Borlido, Silke Czarnetzki, Mai Gehrke, and Andreas Krebs Stone Duality and the Substitution Principle 10.4230/LIPIcs.CSL.2017.13
• Joseph Boudou, Martín Diéguez, and David Fernández-Duque A Decidable Intuitionistic Temporal Logic 10.4230/LIPIcs.CSL.2017.14
• Joseph Boudou Decidable Logics with Associative Binary Modalities 10.4230/LIPIcs.CSL.2017.15
• Matthew de Brecht and Arno Pauly Noetherian Quasi-Polish spaces 10.4230/LIPIcs.CSL.2017.16
• Davide Bresolin, Emilio Muñoz-Velasco, and Guido Sciavicco Fast(er) Reasoning in Interval Temporal Logic 10.4230/LIPIcs.CSL.2017.17
• Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, and Veronika Loitzenbauer Improved Set-Based Symbolic Algorithms for Parity Games 10.4230/LIPIcs.CSL.2017.18
• Yijia Chen, Jörg Flum, and Xuangui Huang Slicewise Definability in First-Order Logic with Bounded Quantifier Rank 10.4230/LIPIcs.CSL.2017.19
• Robin Cockett and Jean-Simon Lemay Integral Categories and Calculus Categories 10.4230/LIPIcs.CSL.2017.20
• Martín H. Escardó and Cory M. Knapp Partial Elements and Recursion via Dominances in Univalent Type Theory 10.4230/LIPIcs.CSL.2017.21
• Olivier Carton, Olivier Finkel, and Dominique Lecomte Polishness of Some Topologies Related to Automata 10.4230/LIPIcs.CSL.2017.22
• Ulysse Gérard and Dale Miller Separating Functional Computation from Relations 10.4230/LIPIcs.CSL.2017.23
• Dan R. Ghica, Achim Jung, and Aliaume Lopez Diagrammatic Semantics for Digital Circuits 10.4230/LIPIcs.CSL.2017.24
• Wan Fokkink and Rob J. van Glabbeek Precongruence Formats with Lookahead through Modal Decomposition 10.4230/LIPIcs.CSL.2017.25
• Berit Grußien Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs 10.4230/LIPIcs.CSL.2017.26
• Erich Grädel, Benedikt Pago, and Wied Pakusa The Model-Theoretic Expressiveness of Propositional Proof Systems 10.4230/LIPIcs.CSL.2017.27
• Miika Hannula Validity and Entailment in Modal and Propositional Dependence Logics 10.4230/LIPIcs.CSL.2017.28
• Gerco van Heerdt, Matteo Sammartino, and Alexandra Silva CALF: Categorical Automata Learning Framework 10.4230/LIPIcs.CSL.2017.29
• Bartek Klin and Mateusz Lelyk Modal mu-Calculus with Atoms 10.4230/LIPIcs.CSL.2017.30
• Martin Lück The Power of the Filtration Technique for Modal Logics with Team Semantics 10.4230/LIPIcs.CSL.2017.31
• Koko Muroya and Dan R. Ghica The Dynamic Geometry of Interaction Machine: A Call-by-Need Graph Rewriter 10.4230/LIPIcs.CSL.2017.32
• Mateus de Oliveira Oliveira On Supergraphs Satisfying CMSO Properties 10.4230/LIPIcs.CSL.2017.33
• Alice Pavaux Inductive and Functional Types in Ludics 10.4230/LIPIcs.CSL.2017.34
• Faried Abu Zaid, Erich Grädel, and Frederic Reinhardt Advice Automatic Structures and Uniformly Automatic Classes 10.4230/LIPIcs.CSL.2017.35
• Wilmer Ricciotti and James Cheney Strongly Normalizing Audited Computation 10.4230/LIPIcs.CSL.2017.36
• Abhisekh Sankaran A Finitary Analogue of the Downward Löwenheim-Skolem Property 10.4230/LIPIcs.CSL.2017.37
• Maria João Gouveia and Luigi Santocanale Aleph1 and the Modal mu-Calculus 10.4230/LIPIcs.CSL.2017.38
• Lionel Vaux Taylor Expansion, lambda-Reduction and Normalization 10.4230/LIPIcs.CSL.2017.39
• Oleg Verbitsky and Maksim Zhukovskii On the First-Order Complexity of Induced Subgraph Isomorphism 10.4230/LIPIcs.CSL.2017.40
• Marc de Visme and Glynn Winskel Strategies with Parallel Causes 10.4230/LIPIcs.CSL.2017.41
• Rostislav Horcík, Tommaso Moraschini, and Amanda Vidal An Algebraic Approach to Valued Constraint Satisfaction 10.4230/LIPIcs.CSL.2017.42