Automated Reasoning satisfiability



Automated Reasoning satisfiability

Automated Reasoning satisfiability


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 …

Duration Approx. 25 hours to complete
Start your Free Trial

Self paced

3,890 already enrolled

4.8stars Rating out of 5 (36 ratings in Coursera)

Go to the Course
We have partnered with providers to bring you collection of courses, When you buy through links on our site, we may earn an affiliate commission from provider.