Sistemas Inteligentes / Inteligência Artificial

Departamento de Ciência de Computadores

Disciplina: Sistemas Inteligentes / Inteligência Artificial

Important Note

Academic Misconduct
All examinations, programming assignments, and written homeworks must be done by each team. Cheating and plagiarism will be dealt with in accordance with University procedures (see below the two documents related to the topic). Hence, code and reports for programming assignments should not be shared across teams. You are encouraged to discuss ideas, approaches and techniques with your peers, but code and reports should be unique for each team. Additionally, text written in reports should not be copied from internet sources. The same holds true for code. Please, have a look at the documents below.

GR.03/07/2011, de 5 de Julho (Artigo 4, parágrafo l)
UPorto Academic Integrity Statement

Important Dates

1st Test (Solution): April 5th

Bibliography: Artificial Intelligence, a modern approach, by Norvig and Russell (Chapters 1 to 6)

Non-informed and informed search (DFS, BFS, Uniform Cost Search, Bidirectional search, IDDFS, greedy, A*, heuristics)
Adversarial search (minimax, alpha-beta, multiple players, other strategies)
Iterative improvement search algorithms (Hill climbing, random-restart hill climbing, simulated annealing, genetic algorithms, beam search)
Memory-bounded search algorithms (IDA*, SMA*, RBFS)
Constraint Satisfaction Problems and algorithms

2nd Test (Solution): May 31st (new date: May 24th, duration: 50 min, from 2pm to 2:50pm)

Bibliography: Artificial Intelligence, a modern approach, by Norvig and Russell (also look at edition 1 for more examples)

Logic:

Cap 7: 7.5.3, 7.5.4, 7.6.1, 7.6.2
Cap 8: 8.2, 8.3.1, 8.3.2
Cap 9: 9.2.2, 9.3.1, 9.3.2, 9.4.1-9.4.3

AI Planning

Cap 10
Cap 13: 13.5

Decision Trees

Cap 18: 18.1, 18.2, 18.3, 18.4

Probabilistic Reasoning

Cap 14: 14.1, 14.2, 14.4

Trab1: Heuristic Search (pdf), (html): deadline March 5th (changed to March 6th)

Paper with suggestions to save space when implementing the 15-puzzle
SLIDES ABOUT SOLVABILITY BASED ON REFS BELOW
About Solvability of N*N-1-puzzles (1)
About Solvability of N*N-1-puzzles (2)
About Solvability of other similar problem
Heuristics and number of states of the 15-puzzle

COMMENTS to TRAB1

Trab2: Adversarial Search (pdf, html): deadline March 23rd

Trab3: Using Prolog (pdf, html): deadline April 20th

Additional material:

Basic Prolog exercises (it is highly recommended that you finish these exercises before starting the assignment):
- Interaction with the Prolog system and simple examples (program "tree")
- Unification
- Backtracking and cut operator (!) (program "likes")
- Program Examples (program "cards")

Trab4: Decision Trees (pdf, html): deadline May 4th (changed to May 13th)

Trab5: Simple Neural Network (pdf): deadline June 15th (this assignment is not compulsory. It will add a bonus to the final score by a maximum of 2 points)

Theoretical Classes

Class 1 (Feb 12): Introduction

Class 2 (Feb 15): Uninformed Search

Map of Portugal

Class 3 (Feb 19):

Heuristic: Straight distances between cities of Portugal

Feb 22: Dias Abertos (Open Day UP): no class

Class 4 (Feb 26): Informed Search (cont.)

Class 5 (Mar 01): Informed Search (cont.)

Class 6 (Mar 05): Adversarial Search

Class 7 (Mar 08): Adversarial Search (cont.)

Class 8 (Mar 12): Adversarial Search (cont.)

Class 9 (Mar 15):

Class 10 (Mar 19): Constraint Satisfaction Problems

Class 11 (Mar 22): Constraint Satisfaction Problems (cont.)

Mar 26, 29, Apr 2: Happy Easter!

Class 12 (Apr 05): FIRST TEST

Class 13 (Apr 09): Logic Programming

Class 14 (Apr 12):

Class 15 (Apr 16): Learning from Observations: Decision Tree Induction

Class 16 (Apr 19): Learning from Observations: Decision Tree Induction (cont.)

Class 17 (Apr 23):

Class 18 (Apr 26): Planning (cont.)

Class 19 (Apr 30):

Class 20 (May 03): Planning (cont.)

May 7-14: Academic Week

Class 21 (May 14): Bayesian Networks

Class 22 (May 17): Bayesian Networks (cont.)

Class 23 (May 21): Introduction to Neural Networks

Complementary notes can be found at: Poole and Mackworth, Artificial Intelligence - Foundations of Computational Agents (specifically, Section 7.4.1)

Class 24 (May 24): SECOND TEST

Class 25 (May 28): NO CLASS

Class 26 (May 31): Corpus Christi

June 7th: EXAM ("Normal")

July 5th: EXAM ("Recurso")

Practical Classes

Week 1 (Feb 12-16): no classes

Week 2 (Feb 19-23): First assignment - SEARCH STRATEGIES (see description above)

Week 3 (Feb 26-Mar 02): First assignment - SEARCH STRATEGIES (see description above)

Week 4 (Mar 05-09): Second assignment - ADVERSARIAL SEARCH (see description above)

Week 5 (Mar 12-16): Second assignment - ADVERSARIAL SEARCH (see description above)

Week 6 (Mar 19-23): Second assignment - ADVERSARIAL SEARCH (see description above)

Mar 26-30: EASTER WEEK

Week 7 (Apr 03-06): Third assignment - FIRST ORDER LOGIC: PROLOG PROGRAMMING (see description above)

Week 8 (Apr 09-13): Third assignment - FIRST ORDER LOGIC: PROLOG PROGRAMMING (see description above)

Week 9 (Apr 16-20): Fourth assignment - DECISION TREE INDUCTION (see description above)

Week 10 (Apr 23-27): Fourth assignment - DECISION TREE INDUCTION (see description above)

Week 11 (Apr 30-May 04): Fourth assignment - DECISION TREE INDUCTION (see description above)

May 7-10: ACADEMIC WEEK

Week 12 (May 14-18): List of exercises (Russell & Norvig, 3rd ed.)

Ch. 8 (Logical Representation): 8.9, 8.10, 8.11, 8.14, 8.17
Ch. 9 (Logical Inference): 9.3, 9.4, 9.6, 9.13, 9.15 (the predicate P should be written in lower case), 9.16, 9.19
Ch. 10 (Classical Planning): 10.1, 10.2, 10.3, 10.4, 10.9, 10.12,
Ch. 14 (Probabilistic Reasoning): 14.1, 14.4 (list to be completed)
Ch. 18 (Decision Tree Induction): 18.1, 18.2, 18.3, 18.4, 18.6, 18.9, 18.12

Week 13 (May 21-25): List of exercises (cont.)