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.
General introduction, and an application to poster printing
Skills You'll Learn
Computational Thinking, Applied Mathematics, Logical Reasoning, Algorithms, Theoretical Computer Science, Computational Logic, Operations Research, Mathematical Modeling, Verification And Validation, Deductive Reasoning, Linear Algebra, Combinatorics
Reviews
4.8 (44 ratings)
- 5 stars81.81%
- 4 stars13.63%
- 3 stars4.54%
DH
Apr 21, 2023
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.
SS
Aug 2, 2019
The course explains the fundamental concepts very clearly. It is very helpful to understand the basic concepts of SMT solvers
From the lesson
SAT/SMT basics, SAT examples
This module introduces SAT (satisfiability) and SMT (SAT modulo theories) from scratch, and gives a number of examples of how to apply SAT.
Taught By
Hans Zantema
prof.dr.