Automated Reasoning: satisfiability
About this course
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.
75/100
CourseAsk score
- What the provider tells you
- 39/45
- Who stands behind it
- 20/35
- How complete the listing is
- 16/20
Scores how much the provider publishes and who stands behind it — not how well it is taught.
What you'll learn
- understand the fundamentals of satisfiability and SMT tools
- apply SAT/SMT tools to various practical problems
- grasp the resolution technique for propositional satisfiability
- learn the CDCL framework for scaling satisfiability
- handle linear inequalities using the simplex method
Course objectives
- introduce students to SAT/SMT tools and their applications
- foster hands-on experience with practical problem-solving using these tools
- explain key theoretical concepts related to satisfiability
Price shown by Coursera — confirm on their site.
Enroll on CourseraYou'll be redirected to Coursera to complete enrollment.
- Listed & compared by CourseAsk
- English · 0
Coursera
Udemy
Compared on these lists
Where this course ranks against the alternatives.