"... and then just encode it to SAT."

Add to your list(s) Download to your calendar using vCal

• Martin Brain, University of Oxford
• Friday 24 April 2015, 10:00-11:00
• Auditorium, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB.

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

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.

This talk is part of the Microsoft Research Cambridge, public talks series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Auditorium, Microsoft Research Ltd, 21 Station Road, Cambridge, CB1 2FB
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Guy Emerson's list
• Interested Talks
• Microsoft Research Cambridge, public talks
• Optics for the Cloud
• PMRFPS's
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• personal list
• rp587

Note that ex-directory lists are not shown.