| | |
Summary: September 2004Copyright 2003 National ICT Australia Limited1
Propositional Satisfiability
(SAT)
Anbulagan
Anbulagan@nicta.com.au
Logic and Computation Program
Canberra Research Laboratory
National ICT Australia (NICTA) Limited
Presented at ANU for NICTA's Overview Course Sept, 2004
September 2004Copyright 2003 National ICT Australia Limited2
Roadmap
Introduction to SAT
Problems in CNF formula
Basic notation and definitions
Phase transition
Backbone and backdoor variables
DPLL procedure
Algorithms for SAT
Complete methods: Satz, Surfsat
Backjumping and Learning
|
