University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Validating SAT Refutations

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Validating SAT Refutations

Download to your calendar using vCal

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

We give an overview of our recent work on validating satisfiability refutations. Satisfiability (SAT) solvers are used not only to find a solution for a Boolean formula, but also to make the claim that no solution exists. If no solution is reported, a solver can emit a proof of unsatisfiability, or refutation, which can then be validated by an unsatisfiability proof checker. Ideally, SAT refutations should be: easy to emit, compact, checked efficiently, checked in a trusted way, and expressive. Existing proof formats support at most two of these five properties. We present a new clausal proof format, called DRUP , that uses clause deletion information and can be checked efficiently.

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

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Structural Studies Coffee room, MRC Laboratory of Molecular Biology Webinar & LT2, Computer Laboratory, William Gates Building. Faculty of Education, Donald McItyre Building, 184 Hills Road, Cambridge, CB2 8PQ room TBC

Other talks

title abstract tbc Title TBC Title and abstract tba Why people with schizophrenia die earlier? Mortality and accelerated ageing Group Presentation 2 Title to be confirmed
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity