The Boolean satisfiability problem is the problem of determining if a given Boolean formula can be consistently replaced by the values TRUE or FALSE. It is an NP-complete problem, meaning it is as difficult to solve as any other problem in the complexity class NP. Heuristic algorithms are able to solve practical SAT problems involving large numbers of variables and formulas.
Stanford University
Fall 2019
This course emphasizes SAT and SMT technology and its applications, offering an understanding of theoretical foundations and how to implement a small theory solver. Applications of SAT/SMT technology in the context of verification are also covered. The advanced topics and lack of specified prerequisites suggest this is a high-level course.
No concepts data
+ 20 more concepts