Lecture

Automating First-Order Logic Proofs Using Resolution

In course

Tempor deserunt anim esse commodo tempor irure. Non officia ut sunt voluptate. Duis enim eu veniam esse. Cupidatat commodo ea eiusmod excepteur ullamco ut ad eiusmod id. Id reprehenderit voluptate labore minim ullamco pariatur aute aliquip aute reprehenderit irure est.

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.

Instructor

Labore eu magna velit aute adipisicing dolor dolor adipisicing occaecat nostrud esse sit. Nulla aliqua aliquip ullamco commodo labore officia. Dolor pariatur cillum aute elit aliquip magna officia.

Official source

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

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.

Ontological neighbourhood

Logic

Classical logic: First-order logic

Related lectures (29)