BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Satisfiability: connecting logic and probability - ramdas aaditya\
 , CMU and intern
DTSTART:20120822T130000Z
DTEND:20120822T140000Z
UID:TALK39332@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:In this talk\, I shall discuss and connect some of the main id
 eas surrounding the vast and interesting topic of Boolean CNF Satisfiabili
 ty. The motivation shall be the possible development of new insights or al
 gorithms\, or an understanding of why some algorithms for SAT might or mig
 ht not work better than others.  I shall start with the above graph but wi
 thout any edges\, and go on to fill in all the edges of the graph through 
 the talk\, in near anticlockwise order from the bottom (if there is shorta
 ge of time\, I will not talk about the two player pebble games\, and if th
 ere is even less time then I’ll just gloss over proof complexity). \n\ns
 ome keywords: \n\nAI – logic + probability\, CNF-SAT\, belief propagatio
 n\, threshold phenomena\, factor graphs\, survey propagation\, integer pro
 gramming\, LP relaxations\, convergent message passing\, dual decompositio
 n\, clause driven conflict learning\, resolution\, extended resolution\, m
 arginal polytope\, convex hulls\, cutting planes\, chvatal-gomory\, sheral
 i-adams\, lovasz-schrijver\, lasserre\, proof systems\, size/width/rank/sp
 ace of proofs\, etc
LOCATION:Small lecture theatre\, Microsoft Research Ltd\, 7 J J Thomson Av
 enue (Off Madingley Road)\, Cambridge
END:VEVENT
END:VCALENDAR