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 introduces first-order logic (FOL) and its application in mathematics and program verification. It covers the semantics of FOL, negation normal form, Skolem functions, Skolemization, conjunctive normal form, resolution, and satisfiability checking. The instructor explains how to transform FOL formulas into clauses, apply sound inference rules, and perform resolution with instantiation to prove the unsatisfiability of a set of clauses.