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 flavour of the applications: fitting rectangles to be applied for printing posters, scheduling problems, solving puzzles, and program correctness. Also, the 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 inequalities. The lightweight approach to following the Automated Reasoning: satisfiability course is just watching the lectures and doing 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.
More programming problems (probably on the later half) would be really interesting and helpful
The course is very good. You can learn a lot. The only downsido is that the questions on some quizzes are not very clear. Like how do you cont the number of steps required to end a DPLL prove etc.
The course explains the fundamental concepts very clearly. It is very helpful to understand the basic concepts of SMT solvers
This course really opened my mind on the possibilities that can be achieved with the SMT solver. Great course!!!
Excellent Course. Concise and to the point. Well chosen examples. I had no background in the topic, but it is quite math-heavy. I am okay with it.
Good course, but some quizes are a bit confusing :)Thank you very much professor.
Showing: 13 of 13
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.
The course explains the fundamental concepts very clearly. It is very helpful to understand the basic concepts of SMT solvers
Excellent Course. Concise and to the point. Well chosen examples.
I had no background in the topic, but it is quite math-heavy. I am okay with it.
The highlight of the course (and my main takeaway) is the theorem prover z3 from Microsoft. Unfortunately, the Python API of this prover was not discussed. I would have liked to see some examples explicitely coded.
The discussion of the simplex algorithm is well done.
I would have liked the details of constraint learning. Unfortunately, this topic was only treated superficially.
I found it really annoying that some parts of the slides were only visible for a few seconds before Prof. Zantema switched to the next slide. This should really be fixed and is the reason I rated this course with only 3 stars instead of 4.
The course is very good. You can learn a lot. The only downsido is that the questions on some quizzes are not very clear. Like how do you cont the number of steps required to end a DPLL prove etc.
The course is a great introduction to satisfiability problem and its wide range of applications in day to day life. Honors assignments really helped me understand the core concepts better.
This course really opened my mind on the possibilities that can be achieved with the SMT solver. Great course!!!
More programming problems (probably on the later half) would be really interesting and helpful
A great introduction for absolute beginners in this topic!
Nice Introduction to SAT, SMT.
It was educational
Good course, but some quizes are a bit confusing :)
Thank you very much professor.
This course can deploy in real life.