School of Computer Science and Software Engineering
The University of Western Australia
Artificial Intelligence and Logic Programming (CITS3212)
Lecture Outline
| TOPICS |
LECTURE NOTES |
| Introduction |
Lecture 1 |
| Propositional Logic |
Lecture 2-4 |
| Predicate Logic |
Lecture 5-8 |
| Unification Algorithm |
Lecture 9-10 |
| PROLOG Programming |
Lecture 11-13 |
| Herbrand Theorem |
Lectures 14-15 |
| Soundness |
Lectures 16 |
| SLD Trees and Searching |
Lecture 17 |
| Negative Information |
Lecture 18 |
| Fixed Point Modelling |
Lecture 19-21 |
| Completeness |
Lecture 22 |
The hard copy of Lecture Notes is provided during the lecture time.
In addition a postscript version of AI & Logic Programming
Lecture Notes from 1992-1994 (with PROLOG programming examples) is available as
an 60 page POSTSCRIPT
extract of current AI & Logic Programming
Lecture Notes
or an 60 page PDF
extract of current AI & Logic Programming
Lecture Notes
.
Other material available
Return to the AI & Logic Programming home page