返回到 Automated Reasoning: satisfiability

4.8

9 个评分

•

3 个审阅

In this course you will learn how to apply satisfiability (SAT/SMT) tools to solve a wide range of problems.
Several basic examples are given to get the flavor of the applications: fitting rectangles to be applied for printing posters, scheduling problems, solving puzzles, and program correctness. Also underlying theory is presented: resolution as a basic approach for propositional satisfiability, the CDCL framework to scale up for big formulas, and the simplex method to deal with linear inequallities.
The light weight approach to following this course is just watching the lectures and do the corresponding quizzes. To get a flavor of the topic this may work out fine. However, the much more interesting approach is to use this as a basis to apply SAT/SMT yourself on several problems, for instance on the problems presented in the honor's assignment....

Jul 19, 2019

This was a great introductory course for satisfiability. I strongly recommend you to solve all the honorary problems because they were so useful for thorough understanding.

Aug 02, 2019

The course explains the fundamental concepts very clearly. It is very helpful to understand the basic concepts of SMT solvers

筛选依据：

创建者 Jaewoo S

•Jul 19, 2019

This was a great introductory course for satisfiability. I strongly recommend you to solve all the honorary problems because they were so useful for thorough understanding.

创建者 santosh s

•Aug 02, 2019

The course explains the fundamental concepts very clearly. It is very helpful to understand the basic concepts of SMT solvers

创建者 Khazam

•Aug 17, 2019

Good course, but some quizes are a bit confusing :)

Thank you very much professor.