Till innehåll på sidan

Computer Science Logic 2017, August 20-24

Full program (EasyChair) ; proceedings (LIPIcs vol 82)

Invited speakers

CSL plenary speakers

  • Laura Kovács, Vienna University of Technology
  • Stephan Kreutzer, Technische Universität Berlin
  • Meena Mahajan, Institute of Mathematical Sciences, Chennai
  • Margus Veanes, Microsoft Research

LC2017–CSL2017 special highlight session

Computer Science Logic 2017 includes a joint special session with the ASL Logic Colloquium 2017, featuring two invited speakers from each conference, presenting highlights of their subject and aimed at the broader community represented by the two conferences. The session will take place at Stockholm University, on the morning of Sunday 20 August.

CSL2017 invited highlight speakers:

  • Phokion Kolaitis, University of California Santa Cruz and IBM Research – Almaden
  • Wolfgang Thomas, RWTH Aachen

LC2017 invited highlight speakers:

  • Verónica Becher, University of Buenos Aires
  • Pierre Simon, University of California, Berkeley

Accepted contributed papers

(by order of submission)

  • Joseph Boudou, Martín Diéguez and David Fernández-Duque. A decidable intuitionistic temporal logic
  • Joseph Boudou. Decidable Logics with associative binary modalities
  • Erich Grädel, Benedikt Pago and Wied Pakusa. The Model-Theoretic Expressiveness of Propositional Proof Systems
  • Dana Angluin, Timos Antonopoulos and Dana Fisman. Query Learning of Derived ω-Tree Languages in Polynomial Time
  • Martin Lück. Filtration versus Team Semantics
  • Miika Hannula. Validity and Entailment in Modal and Propositional Dependence Logics
  • Lionel Vaux. Taylor expansion, β-reduction and normalization
  • Martín Escardó and Cory Knapp. Partial Elements and Recursion via Dominances in Univalent Type Theory
  • Bartek Klin and Mateusz Łełyk. Modal mu-calculus with atoms
  • Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger and Veronika Loitzenbauer. Improved Set-based Symbolic Algorithms for Parity Games
  • Wilmer Ricciotti and James Cheney. Strongly Normalizing Audited Computation
  • Koko Muroya and Dan Ghica. The Dynamic Geometry of Interaction Machine
  • Benedikt Ahrens, Peter LeFanu Lumsdaine and Vladimir Voevodsky. Comparing categorical structures for type theory in the univalent setting
  • Davide Bresolin, Emilio Muñoz-Velasco and Guido Sciavicco. Fast(er) Reasoning in Interval Temporal Logic
  • Robin Cockett and Jean-Simon Lemay. Integral Categories and Calculus Categories
  • Marc De Visme and Glynn Winskel. Strategies with Parallel Causes
  • Bartosz Bednarczyk, Witold Charatonik and Emanuel Kieronski. Extending Two-Variable Logic on Trees
  • Rob van Glabbeek and Wan Fokkink. Precongruence Formats with Lookahead through Modal Decomposition
  • Yijia Chen, Jörg Flum and Xuangui Huang. Slicewise definability in first-order logic with bounded quantifier rank
  • Luigi Santocanale and Maria João Gouveia. aleph_1 and the modal mu-calculus
  • Oleg Verbitsky and Maksim Zhukovskii. On the First-Order Complexity of Induced Subgraph Isomorphism
  • Dan Ghica, Achim Jung and Aliaume Lopez. Diagrammatic Semantics for Digital Circuits
  • Matthew de Brecht and Arno Pauly. Noetherian Quasi-Polish spaces
  • Berit Grußien. Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs
  • Udi Boker. On the (In)Succinctness of Muller Automata
  • Célia Borlido, Silke Czarnetzki, Mai Gehrke and Andreas Krebs. Stone duality and the substitution principle
  • Mateus de Oliveira Oliveira. On Supergraphs Satisfying CMSO Properties
  • Frederic Reinhardt, Faried Abu Zaid and Erich Grädel. Advice Automatic Structures and Uniformly Automatic Classes
  • Amanda Vidal Wandelmer, Rostislav Horčík and Tommaso Moraschini. An Algebraic Approach to Valued Constraint Satisfaction
  • Gerco van Heerdt, Matteo Sammartino and Alexandra Silva. CALF: Categorical Automata Learning Framework
  • Ulysse Gérard and Dale Miller. Separating Functional Computation from Relations
  • Olivier Finkel, Dominique Lecomte and Olivier Carton. Polishness of some topologies related to automata
  • Abhisekh Sankaran. A Finitary Analogue of the Downward Löwenheim–Skolem Property
  • Alice Pavaux. Inductive and Functional Types in Ludics
  • Andrea Aler Tubella, Alessio Guglielmi and Benjamin Ralph. Removing Cycles from Proofs