Start	End	Note	Author(s)	Title
09:00	09:30		Antti Hyvärinen	On interpolants
09:30	10:00		David Monniaux	Data abstraction and completeness
10:00	10:30			coffee break
10:30	11:00		Yu Gu, Takeshi Tsukada and Hiroshi Unno	Optimal CHC Solving via Termination Proofs
11:00	11:30		Maximiliano Klemen, Miguel Á. Carreira-Perpiñán and Pedro Lopez-Garcia	Solving Recurrence Relations using Machine Learning, with Application to Cost Analysis
11:30	12:00		Martin Blicha, Konstantin Britikov and Natasha Sharygina	The Golem Horn Solver
12:00	12:30		Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi and Maurizio Proietti	Multiple Query Satisfiability of Constrained Horn Clauses
				lunch
14:00	14:30	possibly video	Márk Somorjai, Mihály Dobos-Kovács, Zsófia Ádám, Levente Bajczi and András Vörös	Bottoms Up for CHCs: Novel Transformation of Linear Constrained Horn Clauses to Software Verification
14:30	15:00		Daneshvar Amrollahi, Hossein Hojjat and Philipp Rümmer	An Encoding for CLP problems in SMT-LIB
15:00	15:30		Daniel Jurjo, Jose F. Morales, Pedro López-García and Manuel V. Hermenegildo	A rule-based approach for designing and composing abstract domains
15:30	16:00		Florian Frohn and Jürgen Giesl	ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses
16:00	16:30			coffee break
16:30	17:00		Slots for participants to CHC-COMP that would like to present their tools	CHC-COMP
17:00	17:30			CHC-COMP
17:30	18:00			CHC-COMP