Solving QBF by Counterexample-Guided Abstraction Refinement
- ๐ค Speaker: Mikolรกลก Janota, INESC-ID, Lisbon
- ๐ Date & Time: Friday 20 February 2015, 09:00 - 10:00
- ๐ Venue: Auditorium, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB
Abstract
Quantified Boolean formulas (QBFs), as a PSPACE -complete problem, represent a powerful formalism but also a computational challenge. In this talk we will look at how QBFs can be solved by the counterexample-guided abstraction refinement paradigm (CEGAR). The presented technique expands the formula into a SAT problem and uses a SAT solver in a blackbox-fashion. In the second part of the talk we will look at some theoretical aspects of this algorithm, which let us understand the significant improvements in performance on a number of instances in comparison to traditional CDCL solving. This second part of the talk builds on results from proof theory and circuit complexity and therefore we hope that the talk will be interesting both for practitioners as well as theoretitians.
Series This talk is part of the Microsoft Research Cambridge, public talks series.
Included in Lists
- All Talks (aka the CURE list)
- Auditorium, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB
- bld31
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge talks
- Chris Davis' list
- Guy Emerson's list
- Interested Talks
- Microsoft Research Cambridge, public talks
- ndk22's list
- ob366-ai4er
- Optics for the Cloud
- personal list
- PMRFPS's
- rp587
- School of Technology
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Mikolรกลก Janota, INESC-ID, Lisbon
Friday 20 February 2015, 09:00-10:00