Automated Reasoning: satisfiability
About this Course
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 flavour of the applications: fitting rectangles to be applied for printing posters, scheduling problems, solving puzzles, and program correctness. Also, the 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 inequalities. The lightweight approach to following the Automated Reasoning: satisfiability course is just watching the lectures and doing 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.Created by: EIT Digital
Related Online Courses
According to legend, inscribed on walls of the temple on the sacred site of Delphi in Ancient Greece were two premier injunctions: NOTHING IN EXCESS, and KNOW THYSELF. This course will be an... more
This three-course specialization introduces learners to Apigee, Google Cloud\'s full-lifecycle API management platform. Using a combination of presentations, hands-on labs, and supplemental... more
This is a self-paced lab that takes place in the Google Cloud console. Artifact Registry enables you to store different artifact types, create multiple repositories in a single project, and... more
The focus of this course is on the process of managing projects. After planning is done, we need to know how to successfully execute the plan and deliver within the allocated timeframe and cost.... more
This course provides an in-depth journey through modern Java object-oriented and function programming concepts and features, and explores how to apply these concepts and features to implement... more
Powered by
