Transforming a propositional formula to CNF

Loading...
Visualiser le programme de cours

Avis

4.8 (9 notes)
  • 5 stars
    7 ratings
  • 4 stars
    2 ratings
JS

Jul 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.

SS

Aug 02, 2019

The course explains the fundamental concepts very clearly. It is very helpful to understand the basic concepts of SMT solvers

À partir de la leçon
Theory and algorithms for SAT/SMT

Enseigné par

  • Hans Zantema

    Hans Zantema

    prof.dr.

Explorer notre catalogue

Rejoignez-nous gratuitement et obtenez des recommendations, des mises à jour et des offres personnalisées.