"... and then just encode it to SAT."
- đ¤ Speaker: Martin Brain, University of Oxford
- đ Date & Time: Friday 24 April 2015, 10:00 - 11:00
- đ Venue: Auditorium, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB
Abstract
Encoding problems to Boolean satisfiability is a common technique in state-of-the-art program verification tools and theorem provers. Every problem can be encoded in many different ways and the choice of encoding can have a major effect on performance. Unfortunately there are few tools, theoretical or practical, to compare encodings or design better ones. This talk introduces an ongoing program of work which will address this problem. We show how the language of abstract interpretation can be used to capture the notion of the propagating power of an encoding and how this can be used to automatically generate optimal encodings. This not only improves solver performance but also gives a language to explore problem difficulty and understand encodings.
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)

Martin Brain, University of Oxford
Friday 24 April 2015, 10:00-11:00