15-399 Constructive Logic
Lecture 22: Some Applications of SAT

We finish the discussion of Ordered Binary Decision Diagrams as an implementation of Boolean functions. OBDDs have found a number of industrial applications in hardware and software verification and other domains such as state-space planning. We will give examples of how problems can be mapped to Boolean satisfiability (SAT) and related problems such as validity, or equality of Boolean functions.

• Reading: Huth & Ryan, pp. 334-350; decidable.pdf, p. 114
• Previous lecture: Binary Decision Diagrams
• Next lecture: Finite State Systems

[ Home | Schedule | Assignments | Handouts | Software | Overview ]

fp@cs
Frank Pfenning