Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the transformation of formulas into conjunctive normal form, the complexity of such transformations, and the efficiency of algorithms for checking satisfiability. It discusses equivalence, equisatisfiability, Tseytin's transformation, and the DPLL algorithm. The lecture also explores data structures in SAT solvers, unit propagation, subsumption, and conflict-driven clause learning.