Knowledge-based systems (CM0377)

Textbook

Flach, P.A., Simply Logical: intelligent reasoning by example, Wiley, 1994.

There is a Web Site associated with this book (NB: the URL given in the book points into thin air, because the author has moved!):
http://www.cs.bris.ac.uk/~flach/SimplyLogical.html

Lecture 1: introductory lecture

Programs:

 family.pl (The family program we looked at)
 family1.pl (The family program, with an added clause that claims someone is male if he or she isn't female: try it out!)

Lecture 2: logic programming, Prolog and proof trees

Lecture 3: recursion, arithmetic and structured terms

Programs:

 fact.pl
 new_fam.pl (using our proprietary list notation)
 new_fam1.pl (using the dotted and the standard list notations)
 owns.pl

Lecture 4: propositional clausal logic and the notion of logical consequence

Lecture 5: relationship of logical consequence to proof by refutation

Lecture 6: relational clausal logic

Lecture 7: full clausal logic and definite clause logic

Lecture 8: controlling the search in Prolog

Lecture 9: reasoning about programs

Programs:

 famil.pl (the families program used in the illustrations)
 interp.pl (the Prolog interpreter)
 famil_interp.pl (the Prolog interpreter with the family clauses added)

Lecture 10: Expert systems

Program:
 comp.clp (the computer fault diagnosis knowledge base)

Lecture 11: backward & forward chaining, and uncertainty, in Prolog

Programs:
 Simpl.pl
 Simpl1.pl
 Simpl2.pl
 cf.pl
 fwd.pl

Information about non-examinable parts, 2001/2002: MS Word Postscript

Lecture 11a: the RETE algorithm

Lecture 12: reasoning with incomplete information

Lecture 13: default and other kinds of nonmonotonic reasoning

Programs:
 conclude1.pl (the default rule interpreter)
 conclude2.pl (same interpreter with different rules)
 

© A.C. Jones 2002