BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260920T212310Z
UID:Seminar-verification-1189@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Patrick Totzke:MAILTO:totzke@liverpool.ac.uk
DTSTART:20231019T110000
DTEND:20231019T120000
SUMMARY:Verification Series
DESCRIPTION:Friedrich Slivovsky:  Intro to QBF Solving and Proof Complexity\n\nThis talk introduces two of the main paradigms in QBF solving: search and expansion. It presents their underlying proof systems, showcases results on their proof complexity, and discusses a connection between proofs and strategies known as 'strategy extraction'. The presentation will also highlight two open questions in the realm of strategy extraction.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=1189
LOCATION:
END:VEVENT
END:VCALENDAR