Boolean satisfiability (SAT) has become an indispensable tool in the synthesis and verification hardware and software systems. In this lecture, we will cover some fundamental elements of SAT and quantified Boolean satisfiability (QSAT). Some examples will be introduced to show how SAT and QSAT are applied in solving industrial problems.
Last modified: 2017/07/24 16:06
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International