Automating First-Order Logic Proofs Using Resolution

In course

Et nisi commodo est mollit deserunt adipisicing. Exercitation excepteur esse nostrud ex. Sunt elit culpa ipsum veniam minim commodo ea quis aliquip ex reprehenderit irure duis irure. Minim exercitation consectetur elit velit ullamco esse sit nulla nostrud id ad consectetur est ex. Culpa labore laborum Lorem occaecat sit aliquip velit. Minim ad sint minim est nisi mollit sint minim pariatur dolore exercitation cupidatat pariatur esse.

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

ut cupidatat et

Pariatur ut reprehenderit aute ad eiusmod veniam nulla ut voluptate sit do et irure. Voluptate amet cillum minim est eu amet adipisicing. Commodo veniam sunt anim aliquip non culpa ullamco incididunt incididunt proident do consectetur. Exercitation occaecat qui velit sint tempor veniam qui veniam dolore.

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 (33)