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 GraphSearch.
This lecture covers the fundamentals of theorem proving in first-order logic, focusing on the saturation-based theorem proving approach. It explains the implementation of the saturation algorithm, the types of inferences used, and the challenges of theorem proving in first-order logic. The lecture also introduces the Vampire theorem prover and its unique strategies for efficient and complete theorem proving.