$2^{\text{To be, or not to be?}}$: A look at boolean satisfiability

Abstract

The boolean satisfiability problem (SAT) is introduced. State-of-the-art methods that build upon DPLL and CDCL are covered. An alternative solving method called Stalmarck is also discussed. Slides uploaded have animations and potential sensitive slides removed.

Date
Event
DSO technical sharing
Location
Singapore
Links