Open to UnRAVeL-members: AlMoTh 2019

 

Monday, March 18, 2019, 12:30pm

AlMoTh 2019 - Algorithmic Model Theory Meeting 2019

 

Location: b-it seminar room (5053. 1/2), located in the building "Erweiterungsbau E2" of the Informatikzentrum.

Monday:

12.30 – 13.30 Welcome Soup

13.30 – 14.05 Christopher Spinrath: "Parallel-Correctness for Datalog Programs"

14.05 – 14.40 Peter Lindner: "Infinite probabilistic databases"

14.40 – 15.15 Katrin Dannert: "Provenance for Guarded Logics"

15.15 – 15.45 Coffee break

15.45 – 16.20 Nils Vortmeier: "Reachability under more changes"

16.20 – 16.55 Markus Schmid: "Regular Expressions with Backreferences: Polynomial-Time Matching Techniques"

16.55 – 17.30 Richard Wilke: "Logics with Multiteam Semantics"

17.30 – 18.05 Jakub Ledl: "Algebras for ranked forests"

19.30 Dinner

Tuesday:

9.00 – 9.35 Dietrich Kuske: "Languages ordered by the subword order"

9.35 – 10.10 Daniel Neuen: "Canonisation and Definability for Graphs of Bounded Rank Width"

10.10 – 10.45 Sandra Kiefer: "A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus"

10.45 – 11.15 Coffee break

11.15 – 11.50 Matthias Niewerth: "Enumeration on Trees with Tractable Combined Complexity and Efficient Updates"

11.50 – 12.25 Steffen van Bergerem: "Learning Concepts Definable in First-Order Logic with Counting"

12.25 – 13.00 Martin Grohe:  "Weisfeiler and Leman go Neural"