Algorithmic Model Theory Meeting 2017
We have prepared a guide comprising directions, map excerpts, and the program in two variants: an electronic version and a print version.
Important Dates
January, 31 | Deadline for hotel reservations at special conference rate |
February, 13 |
Submission deadline for abstracts/talks |
February, 25 |
Registration deadline |
March, 7/8 | AlMoTh 2017 |
Date & Venue
The AlMoTh 2017 meeting will take place on March 7/8, 2017, just before STACS, at the Leibniz Universität Hannover.
Time: | March 7/8, 2017 |
Place: | Leibniz Universität Hannover, Appelstraße 4, Room 023 |
Contact: | Christopher Spinrath This email address is being protected from spambots. You need JavaScript enabled to view it. |
Directions to the meeting venue including a map may be found on the website of the Institute for Theoretical Computer Science. The talks will be held in room 023 of the institute's building.
Registration & Talks
- If you plan to attend AlMoTh 2017, please send a short email with the term "AlMoTh 2017 Registration" in the subject to This email address is being protected from spambots. You need JavaScript enabled to view it. by February 25, 2017. Then we can prepare a name tag and reserve a seat for you at the AlMoTh dinner.
- If you want to give a talk at AlMoTh 2017 (25 minutes), please send the title and a short abstract via email to This email address is being protected from spambots. You need JavaScript enabled to view it. by February 13, 2017.
Dinner
On Tuesday, March, 7, at 8p.m. a joint dinner will take place at the Indian restaurant Himalaya.
Program
A PDF version of the program including all abstracts can be downloaded here.
Program Tuesday, March 7
13:00–13:25 |
Julian Bitterlich TU Darmstadt |
|
Acyclicity, Simple Connectivity, and Unbranched Covers of Hypergraphs
|
|
13:25–13:50 |
|
Kord Eickmeyer TU Darmstadt |
FO model checking on map graphs
|
|
13:50–14:15 |
|
Nicole Schweikardt Humboldt-Universität zu Berlin |
First-order logic with counting: at least, weak Hanf normal forms always
exist and can be computed!
|
|
14:15–14:45 |
|
Coffee Break | ||
14:45–15:10 |
|
Florian Bruse Universität Kassel |
The State of HFL Model-Checking
|
|
15:10–15:35 |
|
Felix Canavoi TU Darmstadt |
A Modal Characterisation Theorem for Common Knowledge Logic
|
|
15:35–16:00 |
|
Marco Voigt Max-Planck-Institut für Informatik |
A fine-grained hierarchy of complete problems in the separated
fragment of first-order logic
|
|
16:00–16:15 |
|
Coffee Break | ||
16:15–16:40 |
|
Berit Grußien Humboldt-Universität zu Berlin |
Capturing Polynomial Time using Modular Decomposition
|
|
16:40–17:05 |
|
Roman Rabinovich TU Berlin |
Model-Checking for Successor-Invariant First-Order Formulas
on Graph Classes of Bounded Expansion
|
|
17:05–17:30 |
|
Sebastian Siebertz TU Berlin |
Polynomial Kernels and Wideness Properties of
Nowhere Dense Graph Classes
|
|
17:30–17:45 |
|
Coffee Break | ||
17:45-18:10 |
|
Isolde Adler University of Leeds |
Property Testing for structures of bounded degree
|
|
18:10–18:35 |
|
Martin Ritzert RWTH Aachen University |
Learning first-order definable concepts over structures of small degree
|
|
20:00 |
|
Dinner |
Program Wednesday, March 8
9:00–9:25 |
Andre Frochaux Humboldt-Universität zu Berlin |
|
Static Analysis of Monadic Datalog on Finite Labeled Trees
|
|
9:25–9:50 |
|
Erich Grädel RWTH Aachen University |
Provenance Analysis in Logic and Games
|
|
9:50–10:15 |
|
Matthias Niewerth Universität Bayreuth |
Enumeration of MSO Queries on Strings with Constant Delay
and Logarithmic Updates
|
|
10:15–10:45 |
|
Coffee Break | ||
10:45–11:10 |
|
Christoph Berkholz Humboldt-Universität zu Berlin |
Answering Conjunctive Queries under Updates
|
|
11:10–11:35 |
|
Jens Keppeler Humboldt-Universität zu Berlin |
Answering FO+MOD queries under updates on bounded degree
databases
|
|
11:35–12:00 |
|
Nils Vortmeier TU Dortmund |
Connecting AC1 and Dynamic Descriptive Complexity
|
|
12:00–12:15 |
|
Coffee Break
|
||
12:15–12:40 |
|
Martin Grohe RWTH Aachen University |
The Descriptive Complexity of Solving Linear Equation Systems and
its Applications
|
|
12:40–13:05 |
|
Daniel Neuen RWTH Aachen University |
An exponential lower bound for Individualization-Refinement
algorithms for Graph Isomorphism
|
Accommodation
You may book reserved rooms (shared with STACS) at a special conference rate until January 31, 2017, if you mention the keywords "STACS 2017". Please, note that you have to contact the hotel directly, either by email or using the contact form on the hotel's web page, and mention the keywords in order to receive the conference rate. We have reserved rooms at the following two hotels:
-
Concorde Hotel Am Leineschloss (English webpage), €115 pn incl. breakfast.
Contact: This email address is being protected from spambots. You need JavaScript enabled to view it. -
Hotel Central Hannover (German webpage), €75 pn incl. breakfast.
Contact: This email address is being protected from spambots. You need JavaScript enabled to view it.
Mailing List
News about the AlMoTh 2017 meeting will appear on this website and announced on the las-almoth mailing list. If you are currently not on this mailing list, you may subscribe yourself here.
Organizers
Arne Meier (Universität Hannover) and Christopher Spinrath (TU Dortmund)