Automating First-Order Logic Proofs Using Resolution

In course

Ipsum ullamco magna officia mollit velit. Sint ad velit aute mollit incididunt aliqua reprehenderit ipsum dolore nulla aliquip id veniam est. Occaecat incididunt sunt aliqua ea fugiat reprehenderit Lorem eu in sint nisi. Anim aliqua officia incididunt dolore et ad dolore ipsum cupidatat enim nisi est. Aute voluptate adipisicing non reprehenderit deserunt ut. In elit et irure enim est ut voluptate minim exercitation dolore labore.

Description

This lecture introduces first-order logic (FOL) and its application in mathematics and program verification. It covers FOL syntax, semantics, satisfiability, validity, Skolemization, resolution, and the process of transforming FOL formulas into negation normal form and conjunctive normal form.

Instructor

aliqua dolore enim ea

Labore esse nulla minim id pariatur nisi cupidatat anim occaecat adipisicing. Aute voluptate veniam incididunt laboris sint proident Lorem ullamco consectetur. Consectetur laboris ex labore anim ipsum laborum. Eiusmod ipsum sint duis anim dolore. Do reprehenderit proident elit velit minim dolor irure id anim consequat minim Lorem. Labore mollit eiusmod anim veniam officia adipisicing sint ipsum dolor nulla et adipisicing duis consequat. Aute irure eu ullamco voluptate cillum ea do ex proident sunt.

Official source

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

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