Theoretical Computer Science

Mini-Symposium: Integration of Automated Deduction and Interactive Theorem Proving

November 22, 2018, Innsbruck, Austria

12:00 – 13:00 Armin Biere
Efficient SAT Solving
13:00 – 14:00 Christoph Weidenbach
Robust First-Order Reasoning
14:00 – 15:00 Cezary Kaliszyk
Learning Theorem Proving from Scratch
15:00 – 16:00 Moshe Vardi (via WebEx)
The Siren Song of Temporal Synthesis
17:00 – (chair: Kenji Miyamoto) Dinner

Abstracts of the techical presentations can be found here.