time 
speaker 
title 
8:45 
Stephan Kreutzer, TU Berlin 
Opening 
9:00 
Wolfgang Thomas, RWTH Aachen 
On the fall and the rise of logic
In this talk a broad (and somewhat subjective and biased) view of the history of mathematical logic is pursued, where Leibniz’s characteristica universalis and its revival in Frege’s „Begriffsschrift“ are the starting point. We comment on the subsequent development up to the 1980’s when some stagnation in the profile of logic was overcome by challenges that originated in computer science. We illustrate this shift of logic to new directions and brilliant perspectives by expanding on work of Erich Grädel, which can serve here as a master example.

9:45 
Jouko Väänänen, University of Helsinki 
An atom's worth of anonymity 
10:30 
coffee break 

11:00 
Martin Otto, TU Darmstadt 
Amalgamation, Bisimulation, Cycles
Cyclic configurations in finite graph and hypergraphlike structures can often be eliminated locally by means of finite bisimilar coverings. Such coverings can rather generically be based on suitable finite groups or groupoids and their Cayley graphs. Relevant concepts and constructions are surveyed with a view to a recent result that unifies the existing treatments.

11:45 
Marcin Jurdziński, University of Warwick 
Parity games, universal trees, and separating automata 
12:30 
lunch 

14:00 
Martin Grohe, RWTH Aachen 
The Graph Isomorphism Problem
The question of whether there is a polynomial time algorithm deciding if two graphs are isomorphic has been a one of the best known open problems in theoretical computer science for more than forty years. Indeed, the graph isomorphism problem is one of the very few natural problems in NP that is neither known to be in P nor known to be NPcomplete. Three years ago, Babai gave a quasipolynomial time isomorphism algorithm. Despite of this breakthrough result, the question for a polynomial algorithm remains wide open.
My talk will be a survey of recent progress on the isomorphism problem. I will focus on generic algorithmic strategies (as opposed to algorithms tailored towards specific graph classes) that have proved to be useful and interesting in various context, both theoretical and practical.

14:45 
Val Tannen, University of Pennsylvania 
Provisioning Queries and Analytics
Provisioning is a technique for avoiding repeated expensive computations in whatif analysis. Given a query, an analyst formulates k hypotheticals, each retaining some of the tuples of a database instance, possibly overlapping, and she wishes to answer the query under scenarios, where a scenario is defined by a subset of the hypotheticals that are “turned on”. We say that a query admits
compact provisioning if given any database instance and any k hypotheticals, one can create a polysize (in k) sketch that can then be used to answer the query under any of the 2^k possible scenarios without accessing the original instance.
In this talk, we focus on provisioning complex queries that combine relational algebra (the logical component), grouping, and statistics/analytics (the numerical component). We show that positive logical queries with grouping can be compactly provisioned while the addition of negation or recursion requires the sketch size to be exponential in k. Similar lower bounds hold for the exact provisioning of numerical queries but we show that queries that compute quantiles or linear regression (as well as simpler queries that compute count and sum/average of positive values) can be compactly provisioned to provide approximate answers to an arbitrary precision.
Joint work with Sepehr Assadi and Sanjeev Khanna (University of Pennsylvania) and with Yang Li (Facebook)

15:30 
coffee break 

16:00 
Dietmar Berwanger, LSV, CNRS & ENS de Cachan 
Im Ernst das Spiel 
16:30 
Anuj Dawar, University of Cambridge 
Erich and me: a journey through logic 
17:00 
Erich Grädel, RWTH Aachen 
Thank you! 