CS 3018: Artificial Intelligence

These pages contain some basic information, resources and links for the course. 

• Handbook entry for the module
• Further reading suggestions for particular topics in the course.

  ---

• The Turing Test
  • Resources, lecture slides in html format and powerpoint format.
• Lecture slides from the lecture on Attacks on AI in powerpoint format and in html format.

  ---

• Empirical AI
• Lecture slides from the first lecture on Empirical methods in AI in powerpoint format and in html format.
• Lecture slides from the second lecture on Empirical methods in AI in powerpoint format and in html format and postscript handout format.
• Lecture slides from the lecture "Two Become One: Theory and Practice" in postscript form

---

• Search
  • Lecture slides in from Search1 in powerpoint format.
  • Lecture slides in from Search2 in powerpoint format and in html format.
  • Lecture slides in from Search3 in powerpoint format and in html format.
  • Lecture slides in from the lecture Search4 on SAT in powerpoint format and in html format.

  ---

• IJCAI 99
  • Lecture slides including the first practical from the lecture on IJCAI 99 in powerpoint format and in html format.
  • Lecture slides from the second lecture on IJCAI 99 in powerpoint format and in html format.
  • New (March 27) All of the papers discussed in the above two lectures are available on the web:
    • I. Watson and D. Gardingen, A Distributed Case-Based Reasoning Application for Engineering Sales Support
    • Fabio Massacci:  Using walk-SAT and rel-sat for cryptographic key search.
    • S. Colton, A. Bundy and T. Walsh:  Automatic Concept Formation in Pure Mathematics
    • M. Ginsberg:   GIB: Steps towards an expert-level bridge playing program. (Actually a provisional version of the published paper.) See also the commercial GIB page

  ---

• Games
• Lecture slides from the first lecture on Games in powerpoint formatand html format.
• Lecture slides from the second lecture on Games in powerpoint format and in html format.
• Lecture slides from the lecture on Checkers in powerpoint format and in html format.

---

• Constraints
  • A very useful tutorial paper by Barbara Smith is available from Leeds University:
    A Tutorial on Constraint Programming
    Barbara Smith, Research Report 95.14, April 1995. (Abstract)
  • Lectures slides from the first lecture on Constraints on AI in powerpoint format and in html format
  • Lectures slides from the second lecture on Constraints on AI in powerpoint format and in html format and as a postscript handout.
  • Lectures slides from the third lecture on Constraints on AI in powerpoint format and in html format and as a postscript handout.
    • Part of the lecture is based on the following (classic) paper:
      The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared
      Barbara M Smith, S C Brailsford, P M Hubbard & H P Williams, Research Report 95.8, March 1995. (A revised version appears in Proceedings of First International Conference on Principles and Practice of Constraint Programming (CP'95), Springer Verlag LNCS 976, pp 36-52, Cassis, September 1995. A further revised version appears in Constraints, vol. 1, pp. 119-138, 1996.) (Abstract)
  • Patrick Prosser's guest lecture is available in powerpoint format html format, and postscript handout format. Also available is an Oz demo.
• Lectures slides from the lecture describing the second practical in powerpoint format and in html format.
  Resources for the 2nd Practical
  • CSP Problem Format
  • The Zebra Problem in the CSP Problem Format. I believe it has 11 solutions. Also there are variants which have (again I believe) a single solution and no solutions at all.
  • Some randomly generated problems in CSP format. Each file contains 10 separate problems. Each problem has 20 variables, domain size 10, 95 constraints. The number of conflicts, out of a maximum of 100, is 10, 20, 37, or 54. The number of conflicts is a hotlink to the file. If your program is having trouble with these I can create smaller problems. The first two sets should all be soluble, the last set insoluble, and I don't know about the third one.
  • The 8 Queens puzzle, kindly provided by Daneel Siddiky.
  • On the Forward Checking Algorithm, F. Bacchus and A. Grove, Principles and Practice of Constraint Programming (CP-95), pages 292--309, 1995. Lecture Notes in Artificial Intelligence\/} #976, Springer Verlag
  • Dynamic Variable Ordering in CSPs, F. Bacchus and P. van Run, Principles and Practice of Constraint Programming (CP-95), pages 258--275, 1995. Lecture Notes in Artificial Intelligence #976, Springer Verlag.

• Topics in AI
• Lecture slides from the first lecture on Topics in AI in powerpoint format, html format and postscript handout format.