Logic Programming
06-25433
Autumn 2012

 

 

 

Lecture 6: An AI application: Proving theorems of propositional calculus

This lecture shows how theorems of propositional calculus can be solved. It present the Wang algorithm which, when it was first published, was hailed as a great step forward in Artificial Intelligence.

This lecture will:

  • the same pattern of input in Lecture 5;
  • extend the use of operators.
How to prepare

 
  • Ensure you understand how to input terms within a recursive "while loop" (introduced in Lecture 5):
  • Revise your knowledge of propositional calculus, perhaps by using Dr Lee's notes:
Video

  Recording of the lecture (Vimeo)

Slides

  If you really want the slides from the lecture ... but don't forget printing the slides is not the same as understanding them.

Summary

  Summary and programs with commentary from the lecture

Programs from the lecture

 
Example 1 - Wang's theorem prover for the propositional calculus

Individual study suggestions and further reading

 

Study how to represent information, search strategies and simple rules and how non-deterministic problems can be described and processed in Prolog.

Defining operators is covered in:

Theorem proving is introduced in:

Wang's algorthm is described in:

If you want to take this topic further, look at Dr Kerber's project pages:

Assessed work associated with this lecture

  Tutorial sheet 3