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
Automating First-Order Logic Proofs Using Resolution
Description
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.
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.