Dear all,

in contrary to the email that I have just sent you, the next UnRAVeL survey lecture taking place next Thursday, April 22 at 4:30pm will be delivered by Jürgen Giesl (and not by Erich Grädel). He will talk about Inferring Expected Runtimes of Probabilistic Programs. Please find the abstract below:

We present a novel modular approach to infer upper bounds on the expected runtimes of probabilistic integer programs automatically. To this end, it computes bounds on the runtimes of program parts and on the sizes of their variables in an alternating way. To evaluate its power, we implemented our approach in a new version of our tool KoAT.

In the talk, we will also illustrate the history how we developed this approach, mention the problems that occurred during the research, and show the solutions that we found.
The talk of Erich Grädel is scheduled for April 29. I apologize for the confusion.

We are looking forward to seeing many of you at the survey lecture.

Best regards,
Tim Seppelt for the organisation committee


-------- Forwarded Message --------
Subject: Reminder April 22: UnRAVeL "Behind the Scenes" Survey Lecture
Date: Tue, 20 Apr 2021 08:07:48 +0200
From: Tim Seppelt <seppelt@cs.rwth-aachen.de>
To: assistenten@informatik.rwth-aachen.de, vortraege@informatik.rwth-aachen.de
CC: Andreas Klinger <klinger@itsec.rwth-aachen.de>, Birgit Willms <willms@informatik.rwth-aachen.de>, Dennis Fischer <fischer@algo.rwth-aachen.de>


Dear all,

this is a reminder for the next UnRAVeL survey lecture that takes place this Thursday, April 22 at 4:30pm. Erich Grädel will talk about Hidden Variables in Quantum Mechanics and Logics of Dependence and Independence. Following the talk, a PhD student will give an informal summary of their doctoral studies within UnRAVeL.

Hidden-variable models have been proposed since the 1920s as an alternative to the dominant interpretation of quantum mechanics, with the goal to explain and remove certain counterintuitive aspects of quantum mechanics.

We show that logics of dependence and independence, based on team semantics,  provide adequate frameworks for reasoning about hidden-variable models and their purely probabilistic or relational abstractions.

Common desirable properties of hidden-variable models can be defined in an elegant and concise way in dependence and independence logic. The relationship between different properties and their simultaneous realisability can thus be formulated and proven on a purely logical level, as problems of entailment and satisfiability of logical formulae.

Connections between probabilistic and relational entailment in dependence and independence logic allow us to simplify proofs. In many cases, we can establish results on both probabilistic and relational hidden-variable models by a single proof, because one case implies the other, depending on purely syntactic criteria.

We also discuss the famous "no-go“ theorems by Bell and Kochen-Specker and provide a purely logical variant of the latter, introducing non-contextual choice as a team-semantical property.

Further information can be found on https://www.unravel.rwth-aachen.de/go/id/mxjbw?lidx=1#aaaaaaaaaamxjik and below.

The event takes place on Zoom:

https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09
Meeting ID: 960 4371 5437
Passcode: 039217

Since the event is open also to master's students, who may not receive this email, we would kindly appreciate it if you could pass this invitation on.

We are looking forward to seeing many of you at the survey lecture.

Best regards,
Tim Seppelt for the organisation committee


-------- Forwarded Message --------
Subject: UnRAVeL "Behind the Scenes" Survey Lecture
Date: Fri, 19 Mar 2021 10:43:09 +0100
From: Tim Seppelt <seppelt@cs.rwth-aachen.de>
To: assistenten@informatik.rwth-aachen.de, vortraege@informatik.rwth-aachen.de
CC: Andreas Klinger <klinger@itsec.rwth-aachen.de>, Birgit Willms <willms@informatik.rwth-aachen.de>, Dennis Fischer <fischer@algo.rwth-aachen.de>


Dear all,

part of the programme of the research training group UnRAVeL is a series of introductory lectures on the topics of „randomness“ and „uncertainty“ in UnRAVeL’s research thrusts algorithms and complexity, verification, logic and languages, and their application scenarios. Each lecture is delivered by one of the researchers involved in UnRAVeL. The main aim is to provide doctoral researchers as well as master students a broad overview of the subjects of UnRAVeL.

This year, 12 UnRAVeL professors will answer the following questions, based on one of their recent scientific results:

Following these talks, PhD students will give an informal summary of their doctoral studies within UnRAVeL.

All interested doctoral researchers and master students are invited to attend the UnRAVeL lecture series 2021 and engage in discussions with researchers and doctoral students.

Details information can be found on https://www.unravel.rwth-aachen.de/cms/UnRAVeL/Studium/~pzix/Ringvorlesung-Veranstaltung/?lidx=1

All events take place on Thursdays from 16:30 to 18:00 on Zoom https://rwth.zoom.us/j/96043715437?pwd=U0dRczkyQjRCY21abW13TDNmUHlhUT09

We are looking forward to seeing you at the lectures.

Best regards,
Tim Seppelt for the organisation committee

https://www.unravel.rwth-aachen.de/global/show_picture.asp?id=aaaaaaaaaydoczx