You can “subscribe” to any page on the wiki and you’ll get an email message whenever the page has changed. To do that, click the Manage Subscriptions link.

• The course presentation form.

The official week-by-week Faculty timetable: lectures and labs of the course. Note that a LAB may be transformed into a LECTURE and vice-versa.

Office hours: anytime, by previous appointment by email to the lecturer (Enrico Franconi). In any case the lecturer is always available for the period after any lecture.

Some lectures and labs may be available on Microsoft Teams.

• Exclusively English.

• Main book: David Poole and Alan Mackworth. Artificial Intelligence: Foundations of Computational Agents. Cambridge University Press, 2023, 3rd edition 2017. The book is fully available online.
• Auxiliary book: Stuart Jonathan Russell and Peter Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, 4th edition 2020.
• Reading list from the UniBZ Library: Artificial Intelligence / Artificial Intelligence: Foundation of Artificial Intelligence

The following is the standard material, it may be adjusted during the course.

• Slides: Welcome Aboard
• Slides: Artificial Intelligence and Agents parts 1 & 2, part 3, part 4
  • Material: chapter 1 of Poole and Mackworth
• Slides: States and Searching part 1, part 2, part 3, part 4
  • Material: chapter 3 of Poole and Mackworth
• Slides: Features and Constraints part 1, part 2
  • Material: chapter 4 of Poole and Mackworth
• Slides: Propositions and Inference part 1, part 2, part 3, part 4
  Slides: Diagnosis part 1, part 2, part 3, part 4, part 5
  • Material: chapter 5 of Poole and Mackworth
• Slides: Deterministic Planning part 1, part 2, part 3, part 4
  • Material: chapter 6 of Poole and Mackworth
• Slides: Individuals and Relations part 1, part 2, part 3, part 4
  • Material chapter 12 of Poole and Mackworth
• Slides: Natural Language Understanding
  • Material chapter 12 of Poole and Mackworth
• Slides: Supervised learning and Decision Trees: part 1, part 2, part 3.
  • Material chapter 7 of Poole and Mackworth.
• Slides: Introduction to Machine Learning

• LAB 1: Graph Searching with uninformed techniques (Java applet)
  • Manuals:
    • Quick start
    • General Help
    • Tutorial 1: Creating a New Graph with video
    • Tutorial 2: Loading a Preexisting Graph
    • Tutorial 3: Solving a Graph with video
    • Tutorial 4: Search Options
  • Explore with the search applet the Delivery Robot (Acyclic), the Delivery Robot (cyclic), the Vancouver Neighbourood, the Module 4 sample problem graphs: with Depth First, Breadth First, Lowest Cost First search strategies using different Neighbour Ordering Strategies; practice also with the quiz facility.
  • Do the Practice Exercise 3.B.
  • Exercise: practicing different search strategies with the graph in this slides
  • Create your own problem graph for a delivery robot starting from a map with edge costs.
  • Create a problem graph for a simple problem chosen by you.
  • IMPORTANT: learn how to write on paper the frontier evolution for each search.

* LAB 2: Graph Searching with Heuristics

• Explore the Delivery Robot (Acyclic), the Delivery Robot (cyclic), the Vancouver Neighbourood, the Module 4 sample problem graphs: with Best First, Heuristic Depth First, A*, Branch and Bound search strategies, with or without Multiple-Path Pruning or Loop Detection, using different Neighbour Ordering Strategies. Explore also the behaviour with the abovementioned search graphs with potentially non terminating depth first strategies (e.g., Depth First or Heuristic Depth First) without cycle checking, and with loop detection or multiple path pruning.
• Do the Practice Exercises 3.C, 3.D, 3.E.
• Exercise: 3.4
• IMPORTANT:
  • learn how to write on paper the frontier evolution for each search;
  • check whether the heuristics are admissible and monotone.

* LAB 3: Constraints - Consistency

• Consistency Based CSP Solver (applet):
• Explore with the CSP applet the sample problems: Simple Problem 1, Simple Problem 2, Scheduling Problem 1, Crossword Problem 1, Crossword Problem 2. These sample problems have been seen already in the course lectures; for the crossword problems, try to reconstruct the crossword graphical structure.
• Do the Practice Exercises 4.A, 4.B.
• Exercises: 4.2, 4.3 (only a,b), 4.5 - CSP and arc consistency

* LAB 5: Propositions and Inference

• Getting started with AILog2, a representation and reasoning system for definite clauses, with declarative debugging tools.
  • Download the file ailog2.pl, install and launch SWI Prolog, and load (consult) AILog2 in Prolog:
    • Windows: ?- consult("C:\\path-to-file\\ailog2.pl").
    • Mac: ?- consult('/path-to-file/ailog2.pl').
  • Go through the AiLog2 manual, from Section 1 to Section 6.
    • To load a knowledge base file from AILog2:
      • Windows: ailog: load 'C:\\path-to-kbfile\\kbfile.ail'.
      • Mac: ailog: load '/path-to-kbfile/kbfile.ail'.
• Play with the elect_prop.ail electrical wiring example 5.7 from Section 5.3 of the book and the slides.
• Do Exercises 5.1, 5.2, 5.3, 5.4
• Find other AILog knowledge base exampleshere (play with askable and debugging)

* LAB 6: Assumables and Consistency-based Diagnosis

• Excercises 5.9 and 5.13 and 5.17.
  Use AILog2 to verify the correctness of your answers; AILog2 can assert assumables (see manual), and can ask for the derivation of the false atom.

* LAB 7: Debug, Diagnosis, Abduction

• Keep using AILog2
• Go through Sections 6, 7, 9 of the manual
• Play with the following knowledge bases:
  • elect_ask.ail electrical wiring example with askables; Example 5.10 from Section 5.3.2
  • elect_bug.ail the buggy electrical wiring knowledge base from Example 5.14 in Section 5.3.4.1
  • elect_bug2.ail the buggy electrical wiring example from Exercise 5.6
  • elect_bug3.ail a buggy electrical wiring example, which fails to prove lit_l2, but should succeed
  • elect_cbd.ail electrical wiring example for consistency-based diagnosis; Example 5.20 in Section 5.4.3
  • elect_abd.ail electrical wiring example with abduction; Example 5.31 in Section 5.6
  • Exercises: 5.5, 5.6, 5.7, 5.9, 5.13

* LAB 8: Planning with Certainty

• Do Practice Exercise 8.A and Practice Exercise 8.B
• Using the STRIPS-to-CSP applet exercise with the coffee delivery problems (simple and complete) pre-loaded on the applet - tutorial
  • NOTE: the translator from STRIPS to CSP is buggy: use this file as an example of a STRIPS definition for the simple delivery problem with its corresponding CSP version; use the CSP applet
    • understand the role of of all the variables and constraints
    • find the original STRIPS definition from the CSP version of it
    • find all the plans giving a (partial) starting state, or giving a (partial) end state, or both, with an horizon of 3.

* LAB 9: Individuals and Relations

• Keep using AILog2
• Go through Section 8 of the manual
• Understand the bottom-up and top-down derivations with the relational representation of the electrical environment and with the AM and PM time representations
• Do the following exercises (you may use the AILog2 KBs listed in the resources for Chapter 12):
  • 12.3 (bottom-up derivation)
  • 12.4,12.5,12.6 (top-down derivation) with the knowledge base about rooms
  • 12.8,12.9,12.14 (SLD-resolution with functions)