INF2D: 12: Unification and Generalised Modus Ponens

12: Unification and Generalised Modus Ponens

Slides

Unification_GMP.pdf

Contents

  1. A presentation of how to reduce first-order inference to propositional inference.
  2. The unification algorithm.
  3. The generalization of Modus Ponens and the introduction of a new running example.

Required Reading

R&N Sections 9.1–9.2 or NIE Chapter (9) "Inference in First-Order Logic", Sections 1–2.
NOTE: The abbreviation R&N refers to :
“Artificial Intelligence: A Modern Approach” Third Edition, Russell R & Norvig P, Prentice Hall, 2010 (R&N).
The abbreviation NIE stands for the following edition of the same book:
“Artificial Intelligence: A Modern Approach” Third Edition, Pearson New International Edition, Russell R & Norvig P, Pearson, 2014.

Quiz: Unification

These questions are designed to test your understanding of the course content in Lecture 11; doing this quiz does not contribute to your overall grade, but we can give some formative feedback. This quiz requires that you have gone through Lecture 11 and done the required reading.  Some of the questions require a short text answer.  You can ask for formative feedback from your tutor or on piazza.

License
All rights reserved The University of Edinburgh