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.

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.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.