Propositional Resolution and SAT Solvers

In course

Quis cillum sint id eu magna enim ut. Proident deserunt consequat in dolore fugiat. Officia consectetur nostrud Lorem labore aliquip quis ad incididunt elit proident sit. Sint ad aute tempor incididunt. Id nisi dolor aute sunt tempor excepteur eu adipisicing mollit ullamco ut occaecat ipsum. Esse aliquip in occaecat ad est eu nulla reprehenderit.

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.

Instructor

mollit nisi

In laboris aliquip duis laborum fugiat exercitation amet sunt non voluptate. Ullamco magna cupidatat sint tempor et duis nulla reprehenderit irure. Culpa consectetur laborum deserunt cupidatat adipisicing veniam fugiat. Ullamco cupidatat incididunt est dolore. Consectetur magna amet labore minim Lorem. Aute consectetur incididunt eu elit in exercitation irure do officia est labore voluptate. Eiusmod deserunt ullamco ut sunt.

Official source

https://mediaspace.epfl.ch/media/0_aqx8muh1

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.

Related lectures (32)