Automated Reasoning: satisfiability
Completed by Anjolaoluwa Eniola Fajinmi
May 25, 2024
25 hours (approximately)
Anjolaoluwa Eniola Fajinmi's account is verified. Coursera certifies their successful completion of Automated Reasoning: satisfiability
What you will learn
Learn the fundamentals of SAT (Boolean Satisfiability) and SMT (Satisfiability Modulo Theories) solving
Apply SAT/SMT techniques to real problems such as scheduling, Sudoku solving, rectangle fitting, and program verification.
Understand core SAT-solving algorithms including Resolution, DPLL, and CDCL.
Use the Simplex method and SMT techniques to reason about linear inequalities and optimization problems.
Skills you will gain
- Category: Deductive Reasoning
- Category: Combinatorics
- Category: Linear Algebra
- Category: Theoretical Computer Science
- Category: Arithmetic
- Category: Logical Reasoning
- Category: Applied Mathematics
- Category: Model Optimization
- Category: Verification And Validation
- Category: Mathematical Modeling
- Category: Operations Research
- Category: Algorithms
