Monday, July 30, 2018

[DMANET] HIGHLIGHTS 2018: 1st Call for Participation

Please register and attend HIGHLIGHTS 2018!
The programme is here:
https://easychair.org/smart-program/Highlights2018/index.html

REGISTRATION DEADLINE:* 31 AUGUST 2018*

***************
HIGHLIGHTS 2018: 6th annual conference on Highlights of LOGIC, GAMES, and
AUTOMATA

18-21 September 2018, TU Berlin
http://highlights-conference.org

SATELLITE EVENTS:
+ ErichFest: Symposium to Celebrate Erich Grädel's 60th Birthday, 17
September
+ Workshop on the Theory of Regular Cost Functions and Beyond, 21 September
(afternoon)

================================================

HIGHLIGHTS 2018 is the 6th conference on Highlights of Logic, Games, and
Automata that aims to integrate the diverse research community working in
the areas of Logic and Finite Model Theory, Automata Theory, and Games for
Logic and Verification. Individual papers are dispersed across many
conferences, which makes them challenging to follow. A visit to the annual
Highlights conference offers a wide picture of the latest research in the
field and a chance to meet and interact with most of the members of the
research community. The speakers are encouraged to present their best
recent work at Highlights, whether already published elsewhere or not.

The conference is short (from 19 September to the mid-day on 21 September)
and it is preceded by the Highlights Tutorial Day (18 September). The
participation costs are modest and Berlin is easy to reach.

The Contributed Presentations will be around ten minutes long. All speakers
will be also invited to contribute to a Poster Session, which will open new
ways of interaction at the conference for the whole Highlights community.

KEYNOTE PRESENTATIONS
+ Andrei Bulatov, The Complexity of Constraints: Dichotomies and Beyond
+ Nicole Schweikardt, Constant Delay Enumeration of Query Results
+ James Worrell, Algebraic Invariants for Affine Programs

TUTORIALS
+ Amir Abboud, Fine-Grained Complexity and Hardness in P
+ Christoph Berkholz, Interactions Between Proof Complexity and Finite
Model Theory
+ Joost-Pieter Katoen, Principles of Probabilistic Programming

INVITED SESSIONS
+ Chair: Christel Baier, Multi-Objective Reasoning in Probabilistic Models
(Speakers: Stefan Kiefer, David Parker)
+ Chair: Martin Grohe, Logic and Learning (Speakers: Kristian Kersting,
Daniel Neider, Dan Olteanu)

SPOTLIGHT TALKS
+ Stéphane Gaubert, Nonarchimedean Convex Programming and Its Relation to
Mean-Payoff Games
+ Laura Kovács, Symbol Elimination for Program Analysis
+ Jan Křetínský, A Journey from LTL to Your Favourite Automaton
+ Amaury Pouly, Continuous Models of Computation: Computability,
Complexity, Universality
+ Jeffrey Shallit, Finite Automata and Additive Number Theory

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************