Automated Reasoning: satisfiability
- Offered byCoursera
- Public/Government Institute
Automated Reasoning: satisfiability at Coursera Overview
Duration | 25 hours |
Total fee | Free |
Mode of learning | Online |
Difficulty level | Intermediate |
Official Website | Explore Free Course  |
Credential | Certificate |
- Overview
- Highlights
- Course Details
- Curriculum
Automated Reasoning: satisfiability at Coursera Highlights
- Earn a shareable certificate upon completion.
- Flexible deadlines according to your schedule.
Automated Reasoning: satisfiability at Coursera Course details
- 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.
Automated Reasoning: satisfiability at Coursera Curriculum
SAT/SMT basics, SAT examples
General introduction, and an application to poster printing
Introduction to SAT
SMT syntax and tools
Eight queens problem
Binary Arithmetic: addition
Binary Arithmetic: multiplication
Examples from the lecture
Eight queens formula in SMT syntax
Truth table
Carries in binary addition
Binary multiplication
SMT applications
Rectangle fitting
Solving Sudoku
Scheduling
Bounded model checking
Sudoku formula in SMT 2 format
Introduction
Rectangle fitting
Scheduling
Bounded Model Checking
Filling trucks for a magic factory
A sudoku variant
Job scheduling
Program correctness
Theory and algorithms for CNF-based SAT
Resolution
Example of resolution
DPLL
Transforming DPLL to resolution
CDCL basics
CDCL optimizations
Resolution
apply resolution
DPLL
DPLL to resolution
CDCL basics
Theory and algorithms for SAT/SMT
Transforming a propositional formula to CNF
The Tseitin transfomation
Introduction to the Simplex method
Optimizing by the Simplex method
Checking feasibility by the Simplex method
The Simplex method and SMT
Transforming a propositional formula to CNF
The Tseitin transfomation
Slack form
Optimizing by the Simplex method
Other courses offered by Coursera
Student Forum
Anything you would want to ask experts?
Useful Links
Know more about Coursera
Know more about Programs
- Teaching & Education
- Middle School
- Physical Education
- Pre Primary & Primary School
- Secondary & Sr. Secondary School
- Nursery & Primary Teacher Training (NPTT)
- Special Education
- Nursery Teacher Training (NTT)
- Early Childhood Care & Education (ECCE)
- Vocational Education
- Pre Primary Teacher Training (PPTT)
- Primary Teacher Training (PTT)