Get started with custom lists to organize and share courses.

Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

# Automated Reasoning: satisfiability

0 Reviews 60 students interested
Found in
• Provider Coursera
• Cost Free Online Course (Audit)
• Session Upcoming
• Language English
• Certificate Paid Certificate Available
• Start Date
• Duration 4 weeks long

Taken this course? Share your experience with other students. Write review

## Overview

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.

## Syllabus

WEEK 1

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.

WEEK 2

SMT applications

This module shows a number of applications of satisfiability modulo the theory of linear inequalities (SMT)

WEEK 3

Theory and algorithms for CNF-based SAT

This module describes how a rule called Resolution serves to determine whether a propositional formula in conjunctive normal form (CNF) is unsatisfiable. It is shown how an approach called DPLL does the same job, and how it is related to resolution. Finally, it is shown how current SAT solvers essentially implement and optimize DPLL.

WEEK 4

Theory and algorithms for SAT/SMT

This module consists of two parts. The first part is about transforming arbitrary propositional formulas to CNF, leading to the Tseitin transformation doing this job such that the size of the transformed formula is linear in the size of the original formula. The second part is about extending SAT to SMT, in particular to dealing with linear inequalities. It is shown how the Simplex method for linear optimization serves for this job; the Simplex method itself is explained in detail.

Hans Zantema

## Reviews for Coursera's Automated Reasoning: satisfiability Based on 0 reviews

• 5 star 0%
• 4 star 0%
• 3 star 0%
• 2 star 0%
• 1 star 0%

Did you take this course? Share your experience with other students.

## Class Central

Get personalized course recommendations, track subjects and courses with reminders, and more.