What's important about Quantified Boolean Formulas?
- Speaker: Dr Leroy Chew, University of Leeds
- Date: Tuesday, 30 July 2019 from 15:00 to 16:00
- Location: Room 151
Abstract: As many expressive logics are undecidable, propositional logic is readily used in computer science. One can augment propositional logic with Boolean quantifiers to get the logic known as Quantified Booleans Formulas (QBF). Recently, there has been an increase in focus on QBF solving and an attempt to reconcile practice with theoretical results, particularly from proof complexity. In this talk I’ll be explaining why we should study QBF and what are the important results that it yields.