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
Propositional Resolution and SAT Solvers
Description
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.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.