Automated Reasoning: satisfiability

Name: Automated Reasoning: satisfiability
Brand: Coursera
SKU: 40545
Availability: InStock

FREE

Hans Zantema 12 Computer Science Coursera

Add your review

Description
Instructor Details
Additional information
Reviews (4)

9.3/10 (Our Score)

Product is rated as #10 in category Computer Science

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.

Instructor Details

Hans Zantema

Votes: 0

Courses : 1

Hans Zantema is an Associate Professor in the Department of Mathematics and Computer Science at Eindhoven University of Technology (TU/e) and part time Full Professor at Radboud University in Nijmegen. His main areas of expertise include algorithms, automated reasoning, term rewriting systems, automata theory and constraint solving (systems). His focus areas include the theory behind these topics, and obtaining insight into how various problems can be transformed to formulas, and solved automatically by computer programs manipulating these formulas. Hans is known for his achievements in term rewriting systems, in particular in automatically proving termination of term rewriting. His name is attached to ‘Zantema's problem’: does the string rewrite system 0011 -> 111000 terminate. Academic background Hans Zantema received his PhD in algebraic number theory in 1983 from the University of Amsterdam for his thesis entitled ‘Integer Valued Polynomials in Algebraic Number Theory’. After graduation, Zantema worked at Philips Data Systems for some years, after which he switched to academia. From 1987 to 2000 Hans worked at Utrecht University and in 2000 he joined TU/e. In addition to his position at TU/e, Hans obtained his position at Radboud University in Nijmegen in 2007.

Specification: Automated Reasoning: satisfiability

Duration	13 hours
Year	2019
Level	Intermediate
Certificate	Yes
Quizzes	Yes

4 reviews for Automated Reasoning: satisfiability

4.6 out of 5

★★★★★

Write a review

Show all Most Helpful Highest Rating Lowest Rating

★★★★★
Jaewoo S – July 19, 2019
This was a great introductory course for satisfiability. I strongly recommend you to solve all the honorary problems because they were so useful for thorough understanding.
Helpful(2) Unhelpful(0)You have already voted this
★★★★★
santosh s – August 2, 2019
The course explains the fundamental concepts very clearly. It is very helpful to understand the basic concepts of SMT solvers
Helpful(1) Unhelpful(0)You have already voted this
★★★★★
Khazam – August 17, 2019
Good course, but some quizes are a bit confusing 🙂 Thank you very much professor.
Helpful(0) Unhelpful(0)You have already voted this
★★★★★
Avijit – February 19, 2020
Nice Introduction to SAT, SMT.
Helpful(0) Unhelpful(0)You have already voted this