BSc in Computer Science
      Courseware Sheet
      Artificial Intelligence       I       		WIDTH
      Course No.:DCS/215
      Course Unit Value: 1
      Lecturers:Dr Graem A. Ringwood
      Semester:A

      SOFTWARE:

      WEB SITES:

      Course Outline

      The following gives a week by week breakdown of the material.
Week 1
   Kasparov v Deep Blue
   Collaborative Intelligence
   Background
     ND inference rules for ZOL,
     ND inference rules for quantifiers and identity,
     induction,
     ND inference rules for Set Theory,
   Negation Normal (B&E Section 3.5 p45-47) 
    
Week 2
   Equivalences,
   minterms
   maxterms
   disjunctive normal form
   conjunctive normal form
   clausal form
   refutation proofs
   ZO resolution
   Exercises: G&T Problems 1.5 p41 1,2,3,4,5,6,7,8
              G&T Problems 11.1 p574 6,7,8,9
              B&E p46 9,10
              B&E p85 54, 55, 56
              B&E p253 8,9,10,11,12,13
week 3
   complementation
   interpretations
   satisfiability
   soundness and completeness of ZO resolution 
   refinements
     unit clause
     set of support
     input
     linear
   Horn Clauses
   Exercises: G&T Problems Chap1 p58 13
              G&T Problems Chap 11 p590 1,6,7,8,9
              B&E p256 Problems 14, 15, 16, 17
week 4
   Horn clause satisfiability
   FO complementation
   prenex normal form
   first test(solutions in hidden text)
   Exercises: G&T Problems 11.2 p577 1,2,3
              G&T Problems Chap 11 p590 10,11,12
              B&E p183 49, 52
week 5
   FO equivalences,
   canonical derivations
   FO interpretations
   Skolemization
   Exercises: G&T Problems Chap 11 p590 13,14,15
              B&E p267 7 
              B&E p277 18,19,20,21,22
week 6
   Herbrand interpretations
   unification
   FO resolution 
   most general unifiers
   Exercises:
              R&N Chap 9 p294 9.1 9.2 9.3 9.4 9.5 9.6 9.7 9.8 9.9 9.10
week 7
   revision
   second test(solutions in hidden text)
   Read: R&N Chap 9 and Chap 10 Sections 10.3 & 10.4
week 8
   logic programming
   search trees
   Prolog
     Code to convert ZO sentence to CNF
     well formed sentences
     satisfaction
     literal
     clause
     eliminate iff
     eliminate if
     NNF
     CNF
     flatten a clause
     flatten a CNF
     putting it all together
     an example run
   Exercises:
     G&T Problems 4.1 p192 1,2,3,4,5,6,7,8
     G&T Problems 4.2 p197 1,2,3
     G&T Problems 4.3 p202 1,2,3,4,5,6,7,8
     G&T Problems 4.4 p214 1,2,3,4,5,6,7,8
     G&T Problems 4.5 p221 1,2,3,4,5,6,7
     G&T Problem  4.6 p226 1,2,3
     G&T Problems Chap 11 p226 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21
   
week 9
   exhaustive search (R&N Chap3)
     example graph
     Prolog representation of the graph
     breadthfirst search
     breadthfirst search recording path
     depth first search
     depth first search recording path
     bounded depth first search
     iterative deepening
     depth first avoiding repeated nodes
week 10
   optimising search  (R&N Chap4)
     example graph
     Prolog representation of the graph
     best first search
week 11
   revision
   third test(solutions in hidden text)
week 12
   adversarial search  (R&N Chap5)
     example game
     game code
     minimax
     alpha-beta

      

      Required Work and Expectations
Coursework consists of three graded tests to be done in lecture periods.
These will be given without advance warning.
How much you get out of this course depends on you; it depends on how much on how much time and effort you put into the learning process.  The only way to learn the course material and prepare for the tests and the
examination is by doing as many exercises as possible.
The exercises are vital for developing intuition.
Consequently, doing the examples is the most important activity of the course.
Most exercises will be drawn from the texts.
Students are encouraged to work together in lectures and the lab 
but plagiarism in the tests and the exam will be dealt with severely.

      

      Course Attendance
Attendance of the lectures is compulsory.
Students are required to participate actively in lectures.
Topics and notation will not necessarily be the same as those used in the
texts.  You will be examined on the content of the lectures.
The only excuse for nonattendance will be a medical certificate.


      

      

      

      Feedback
Last modified: Jul  14 00:00:00 1997